./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash acdd122f5068e78adf2c5d9843dc58624176c7bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash acdd122f5068e78adf2c5d9843dc58624176c7bc ...................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:10,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:10,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:10,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:10,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:10,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:10,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:10,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:10,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:10,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:10,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:10,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:10,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:10,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:10,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:10,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:10,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:10,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:10,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:10,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:10,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:10,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:10,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:10,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:10,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:10,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:10,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:10,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:10,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:10,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:10,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:10,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:10,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:10,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:10,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:10,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:10,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:10,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:10,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:10,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:10,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:10,645 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:23:10,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:10,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:10,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:10,661 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:10,661 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:10,662 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:10,662 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:10,662 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:10,662 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:10,662 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:10,662 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:10,663 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:10,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:23:10,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:23:10,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:10,666 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:10,666 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:23:10,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:10,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:10,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:10,667 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:23:10,667 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:23:10,667 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:23:10,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:10,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:10,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:10,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:10,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:10,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:10,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:10,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:10,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:10,669 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:10,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:10,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:10,670 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan 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 -> Taipan 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 -> acdd122f5068e78adf2c5d9843dc58624176c7bc [2019-10-22 11:23:10,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:10,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:10,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:10,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:10,733 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:10,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-10-22 11:23:10,789 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data/b51b65741/e2a4c1c9985b434893bc77784362ea0d/FLAG07c352210 [2019-10-22 11:23:11,225 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:11,226 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-10-22 11:23:11,238 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data/b51b65741/e2a4c1c9985b434893bc77784362ea0d/FLAG07c352210 [2019-10-22 11:23:11,258 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data/b51b65741/e2a4c1c9985b434893bc77784362ea0d [2019-10-22 11:23:11,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:11,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:11,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:11,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:11,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:11,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bf6310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11, skipping insertion in model container [2019-10-22 11:23:11,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,281 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:11,327 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:11,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:11,747 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:11,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:11,862 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:11,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11 WrapperNode [2019-10-22 11:23:11,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:11,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:11,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:11,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:11,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:11,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:11,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:11,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:11,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... [2019-10-22 11:23:11,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:11,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:11,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:11,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:11,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2019-10-22 11:23:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:23:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:23:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:12,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:12,652 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:12,652 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 11:23:12,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:12 BoogieIcfgContainer [2019-10-22 11:23:12,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:12,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:12,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:12,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:12,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:11" (1/3) ... [2019-10-22 11:23:12,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6125ce2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:12, skipping insertion in model container [2019-10-22 11:23:12,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:11" (2/3) ... [2019-10-22 11:23:12,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6125ce2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:12, skipping insertion in model container [2019-10-22 11:23:12,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:12" (3/3) ... [2019-10-22 11:23:12,666 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-10-22 11:23:12,675 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:12,683 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2019-10-22 11:23:12,698 INFO L249 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2019-10-22 11:23:12,718 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:12,720 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:23:12,720 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:12,721 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:12,721 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:12,721 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:12,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:12,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2019-10-22 11:23:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:23:12,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:12,753 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:23:12,755 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:23:12,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:12,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742792119] [2019-10-22 11:23:12,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:12,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:12,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:12,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742792119] [2019-10-22 11:23:12,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:12,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:12,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185163610] [2019-10-22 11:23:12,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:12,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:12,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:12,942 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-10-22 11:23:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:13,153 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-10-22 11:23:13,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:13,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:23:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:13,168 INFO L225 Difference]: With dead ends: 119 [2019-10-22 11:23:13,168 INFO L226 Difference]: Without dead ends: 117 [2019-10-22 11:23:13,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-22 11:23:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-10-22 11:23:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-22 11:23:13,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-10-22 11:23:13,218 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 3 [2019-10-22 11:23:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:13,218 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-10-22 11:23:13,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-10-22 11:23:13,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:23:13,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:13,219 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:23:13,219 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:23:13,220 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:13,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956606968] [2019-10-22 11:23:13,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:13,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:13,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:13,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956606968] [2019-10-22 11:23:13,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:13,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:13,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76207743] [2019-10-22 11:23:13,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:13,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:13,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:13,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:13,271 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 3 states. [2019-10-22 11:23:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:13,431 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-10-22 11:23:13,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:13,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:23:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:13,433 INFO L225 Difference]: With dead ends: 115 [2019-10-22 11:23:13,433 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:23:13,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:23:13,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-10-22 11:23:13,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-22 11:23:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-10-22 11:23:13,447 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 3 [2019-10-22 11:23:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:13,448 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-10-22 11:23:13,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-10-22 11:23:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:23:13,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:13,448 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:13,449 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2019-10-22 11:23:13,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:13,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394272370] [2019-10-22 11:23:13,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:13,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:13,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:13,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394272370] [2019-10-22 11:23:13,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:13,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:13,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872764057] [2019-10-22 11:23:13,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:13,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:13,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:13,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:13,548 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 4 states. [2019-10-22 11:23:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:13,766 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-10-22 11:23:13,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:13,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:23:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:13,768 INFO L225 Difference]: With dead ends: 109 [2019-10-22 11:23:13,768 INFO L226 Difference]: Without dead ends: 109 [2019-10-22 11:23:13,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-22 11:23:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2019-10-22 11:23:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-22 11:23:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-10-22 11:23:13,775 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 8 [2019-10-22 11:23:13,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:13,776 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-10-22 11:23:13,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-10-22 11:23:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:23:13,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:13,776 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:13,777 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2019-10-22 11:23:13,777 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:13,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548655546] [2019-10-22 11:23:13,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:13,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:13,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:13,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548655546] [2019-10-22 11:23:13,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:13,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:13,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962822402] [2019-10-22 11:23:13,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:13,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:13,875 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2019-10-22 11:23:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:14,197 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-10-22 11:23:14,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:14,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-10-22 11:23:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:14,198 INFO L225 Difference]: With dead ends: 136 [2019-10-22 11:23:14,198 INFO L226 Difference]: Without dead ends: 136 [2019-10-22 11:23:14,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-22 11:23:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2019-10-22 11:23:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-22 11:23:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2019-10-22 11:23:14,211 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 8 [2019-10-22 11:23:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:14,211 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2019-10-22 11:23:14,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2019-10-22 11:23:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:23:14,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:14,212 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:14,213 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:14,213 INFO L82 PathProgramCache]: Analyzing trace with hash 292159341, now seen corresponding path program 1 times [2019-10-22 11:23:14,213 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:14,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081646219] [2019-10-22 11:23:14,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:14,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:14,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:14,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081646219] [2019-10-22 11:23:14,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:14,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:14,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097123806] [2019-10-22 11:23:14,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:14,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:14,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:14,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:14,306 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 6 states. [2019-10-22 11:23:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:14,757 INFO L93 Difference]: Finished difference Result 230 states and 254 transitions. [2019-10-22 11:23:14,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:14,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 11:23:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:14,759 INFO L225 Difference]: With dead ends: 230 [2019-10-22 11:23:14,759 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 11:23:14,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 11:23:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 124. [2019-10-22 11:23:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-22 11:23:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2019-10-22 11:23:14,790 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 11 [2019-10-22 11:23:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:14,790 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2019-10-22 11:23:14,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2019-10-22 11:23:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:23:14,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:14,791 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:14,793 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash 292159342, now seen corresponding path program 1 times [2019-10-22 11:23:14,794 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:14,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529647059] [2019-10-22 11:23:14,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:14,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:14,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:14,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529647059] [2019-10-22 11:23:14,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:14,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:14,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249252034] [2019-10-22 11:23:14,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:14,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:14,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:14,870 INFO L87 Difference]: Start difference. First operand 124 states and 138 transitions. Second operand 6 states. [2019-10-22 11:23:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:15,303 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2019-10-22 11:23:15,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:23:15,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 11:23:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:15,304 INFO L225 Difference]: With dead ends: 225 [2019-10-22 11:23:15,304 INFO L226 Difference]: Without dead ends: 225 [2019-10-22 11:23:15,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:23:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-22 11:23:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 116. [2019-10-22 11:23:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-22 11:23:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2019-10-22 11:23:15,314 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 11 [2019-10-22 11:23:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:15,314 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2019-10-22 11:23:15,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2019-10-22 11:23:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:23:15,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:15,315 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:15,315 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 125654908, now seen corresponding path program 1 times [2019-10-22 11:23:15,316 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:15,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100455928] [2019-10-22 11:23:15,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:15,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:15,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:15,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100455928] [2019-10-22 11:23:15,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:15,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:15,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032352423] [2019-10-22 11:23:15,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:15,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:15,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:15,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:15,369 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 3 states. [2019-10-22 11:23:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:15,379 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2019-10-22 11:23:15,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:15,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-22 11:23:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:15,380 INFO L225 Difference]: With dead ends: 118 [2019-10-22 11:23:15,380 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 11:23:15,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 11:23:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-10-22 11:23:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-22 11:23:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2019-10-22 11:23:15,391 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 17 [2019-10-22 11:23:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:15,391 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2019-10-22 11:23:15,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2019-10-22 11:23:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:23:15,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:15,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:15,392 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:15,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1649352454, now seen corresponding path program 1 times [2019-10-22 11:23:15,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:15,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126532271] [2019-10-22 11:23:15,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:15,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:15,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:15,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126532271] [2019-10-22 11:23:15,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:15,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:15,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493089823] [2019-10-22 11:23:15,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:15,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:15,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:15,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:15,476 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand 6 states. [2019-10-22 11:23:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:15,678 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2019-10-22 11:23:15,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:23:15,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-22 11:23:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:15,680 INFO L225 Difference]: With dead ends: 137 [2019-10-22 11:23:15,680 INFO L226 Difference]: Without dead ends: 137 [2019-10-22 11:23:15,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-22 11:23:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2019-10-22 11:23:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-22 11:23:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2019-10-22 11:23:15,684 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 17 [2019-10-22 11:23:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:15,685 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2019-10-22 11:23:15,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2019-10-22 11:23:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:23:15,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:15,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:15,686 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:15,687 INFO L82 PathProgramCache]: Analyzing trace with hash 5763469, now seen corresponding path program 1 times [2019-10-22 11:23:15,687 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:15,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521879873] [2019-10-22 11:23:15,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:15,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:15,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:15,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521879873] [2019-10-22 11:23:15,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:15,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:15,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915862508] [2019-10-22 11:23:15,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:15,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:15,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:15,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:15,778 INFO L87 Difference]: Start difference. First operand 124 states and 138 transitions. Second operand 6 states. [2019-10-22 11:23:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:16,008 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2019-10-22 11:23:16,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:16,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-22 11:23:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:16,010 INFO L225 Difference]: With dead ends: 141 [2019-10-22 11:23:16,010 INFO L226 Difference]: Without dead ends: 141 [2019-10-22 11:23:16,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-22 11:23:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 134. [2019-10-22 11:23:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-22 11:23:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2019-10-22 11:23:16,014 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 19 [2019-10-22 11:23:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:16,014 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2019-10-22 11:23:16,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:16,014 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2019-10-22 11:23:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:23:16,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:16,015 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:16,015 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:16,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1229414848, now seen corresponding path program 1 times [2019-10-22 11:23:16,016 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:16,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913436442] [2019-10-22 11:23:16,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:16,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913436442] [2019-10-22 11:23:16,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:16,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:16,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555078333] [2019-10-22 11:23:16,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:16,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:16,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:16,084 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 6 states. [2019-10-22 11:23:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:16,349 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2019-10-22 11:23:16,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:16,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-22 11:23:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:16,351 INFO L225 Difference]: With dead ends: 186 [2019-10-22 11:23:16,351 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 11:23:16,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 11:23:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 132. [2019-10-22 11:23:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 11:23:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 148 transitions. [2019-10-22 11:23:16,354 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 148 transitions. Word has length 21 [2019-10-22 11:23:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:16,355 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 148 transitions. [2019-10-22 11:23:16,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2019-10-22 11:23:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:23:16,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:16,357 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:16,357 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1229414847, now seen corresponding path program 1 times [2019-10-22 11:23:16,357 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:16,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011066496] [2019-10-22 11:23:16,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:16,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011066496] [2019-10-22 11:23:16,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:16,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:16,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395214551] [2019-10-22 11:23:16,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:16,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:16,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:16,422 INFO L87 Difference]: Start difference. First operand 132 states and 148 transitions. Second operand 6 states. [2019-10-22 11:23:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:16,671 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2019-10-22 11:23:16,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:16,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-22 11:23:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:16,672 INFO L225 Difference]: With dead ends: 188 [2019-10-22 11:23:16,673 INFO L226 Difference]: Without dead ends: 188 [2019-10-22 11:23:16,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-22 11:23:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 131. [2019-10-22 11:23:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-22 11:23:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2019-10-22 11:23:16,676 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 21 [2019-10-22 11:23:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:16,677 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2019-10-22 11:23:16,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2019-10-22 11:23:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:23:16,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:16,678 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:16,678 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION]=== [2019-10-22 11:23:16,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:16,678 INFO L82 PathProgramCache]: Analyzing trace with hash -996981943, now seen corresponding path program 1 times [2019-10-22 11:23:16,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:16,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685421381] [2019-10-22 11:23:16,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:16,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685421381] [2019-10-22 11:23:16,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248616274] [2019-10-22 11:23:16,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:16,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 11:23:16,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:16,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:16,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 11:23:16,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:16,995 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-10-22 11:23:16,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:16,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-10-22 11:23:17,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-22 11:23:17,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:17,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:17,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:17,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-10-22 11:23:17,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:17,129 INFO L375 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 1 case distinctions, treesize of input 36 treesize of output 51 [2019-10-22 11:23:17,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:17,151 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-10-22 11:23:17,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:17,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-10-22 11:23:17,226 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-22 11:23:17,226 INFO L375 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-10-22 11:23:17,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:17,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:17,244 INFO L567 ElimStorePlain]: treesize reduction 32, result has 51.5 percent of original size [2019-10-22 11:23:17,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:17,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-10-22 11:23:17,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:17,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-10-22 11:23:17,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:17,343 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-10-22 11:23:17,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:17,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-10-22 11:23:17,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:17,406 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:17,416 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:17,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:17,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:17,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-10-22 11:23:19,179 INFO L375 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 390 treesize of output 382 [2019-10-22 11:23:19,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,198 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:19,445 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-10-22 11:23:19,445 INFO L567 ElimStorePlain]: treesize reduction 277, result has 27.5 percent of original size [2019-10-22 11:23:19,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 39 dim-0 vars, and 7 xjuncts. [2019-10-22 11:23:19,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:867 [2019-10-22 11:23:19,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:19,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:19,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:22,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [857422595] [2019-10-22 11:23:22,065 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 25 [2019-10-22 11:23:22,107 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:23:22,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:23:22,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:22,400 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:23:22,404 INFO L168 Benchmark]: Toolchain (without parser) took 11142.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -266.8 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:22,405 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:22,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:22,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.93 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. [2019-10-22 11:23:22,406 INFO L168 Benchmark]: Boogie Preprocessor took 60.33 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. [2019-10-22 11:23:22,406 INFO L168 Benchmark]: RCFGBuilder took 676.14 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: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:22,407 INFO L168 Benchmark]: TraceAbstraction took 9748.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.8 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:22,410 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 600.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.93 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 60.33 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 676.14 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: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9748.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.8 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:24,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:24,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:24,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:24,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:24,775 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:24,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:24,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:24,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:24,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:24,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:24,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:24,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:24,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:24,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:24,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:24,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:24,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:24,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:24,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:24,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:24,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:24,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:24,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:24,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:24,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:24,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:24,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:24,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:24,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:24,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:24,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:24,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:24,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:24,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:24,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:24,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:24,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:24,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:24,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:24,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:24,816 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:23:24,843 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:24,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:24,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:24,844 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:24,845 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:24,845 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:24,845 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:24,845 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:24,845 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:24,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:23:24,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:23:24,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:24,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:24,846 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:23:24,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:24,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:24,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:24,850 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:23:24,850 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:23:24,850 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:23:24,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:24,850 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:23:24,850 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:23:24,850 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:24,851 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:23:24,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:24,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:24,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:24,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:24,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:24,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:24,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:24,852 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:23:24,852 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:23:24,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:24,852 INFO L138 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_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan 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 -> Taipan 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 -> acdd122f5068e78adf2c5d9843dc58624176c7bc [2019-10-22 11:23:24,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:24,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:24,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:24,914 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:24,915 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:24,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-10-22 11:23:24,974 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data/90fba8040/246d84113b6049f7a1824ff3816daf8a/FLAG4b7b8ce09 [2019-10-22 11:23:25,405 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:25,406 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-10-22 11:23:25,418 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data/90fba8040/246d84113b6049f7a1824ff3816daf8a/FLAG4b7b8ce09 [2019-10-22 11:23:25,728 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/data/90fba8040/246d84113b6049f7a1824ff3816daf8a [2019-10-22 11:23:25,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:25,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:25,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:25,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:25,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:25,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e4442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25, skipping insertion in model container [2019-10-22 11:23:25,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,747 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:25,786 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:26,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:26,158 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:26,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:26,330 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:26,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26 WrapperNode [2019-10-22 11:23:26,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:26,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:26,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:26,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:26,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:26,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:26,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:26,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:26,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... [2019-10-22 11:23:26,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:26,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:26,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:26,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:26,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2019-10-22 11:23:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:23:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:23:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:26,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:27,348 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:27,349 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 11:23:27,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:27 BoogieIcfgContainer [2019-10-22 11:23:27,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:27,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:27,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:27,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:27,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:25" (1/3) ... [2019-10-22 11:23:27,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79436b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:27, skipping insertion in model container [2019-10-22 11:23:27,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:26" (2/3) ... [2019-10-22 11:23:27,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79436b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:27, skipping insertion in model container [2019-10-22 11:23:27,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:27" (3/3) ... [2019-10-22 11:23:27,362 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-10-22 11:23:27,375 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:27,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 54 error locations. [2019-10-22 11:23:27,395 INFO L249 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2019-10-22 11:23:27,416 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:27,416 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:23:27,416 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:27,417 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:27,417 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:27,417 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:27,417 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:27,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-10-22 11:23:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:23:27,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:27,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:23:27,443 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION]=== [2019-10-22 11:23:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:23:27,458 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:27,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [956670850] [2019-10-22 11:23:27,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c743ccac-8dd3-4092-8d42-8b3abd636b5a/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:27,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:27,700 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort FloatRoundingMode not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:23:27,705 INFO L168 Benchmark]: Toolchain (without parser) took 1972.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -105.3 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,705 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:27,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.90 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. [2019-10-22 11:23:27,707 INFO L168 Benchmark]: Boogie Preprocessor took 64.11 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,708 INFO L168 Benchmark]: RCFGBuilder took 889.98 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: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,708 INFO L168 Benchmark]: TraceAbstraction took 350.23 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,711 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 599.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.90 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 64.11 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 889.98 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: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 350.23 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort FloatRoundingMode not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort FloatRoundingMode not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...