./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.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_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/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 497bfe83d1a123e7e085e38ee3eed2e663cc023e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/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 497bfe83d1a123e7e085e38ee3eed2e663cc023e ...................................................................................................................................................................................................................................................... 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:24:47,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:47,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:47,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:47,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:47,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:47,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:47,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:47,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:47,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:47,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:47,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:47,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:47,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:47,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:47,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:47,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:47,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:47,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:47,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:47,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:47,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:47,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:47,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:47,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:47,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:47,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:47,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:47,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:47,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:47,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:47,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:47,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:47,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:47,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:47,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:47,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:47,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:47,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:47,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:47,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:47,629 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:24:47,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:47,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:47,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:47,643 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:47,643 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:47,643 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:47,643 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:47,643 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:47,643 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:47,644 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:47,644 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:47,644 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:47,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:24:47,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:24:47,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:47,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:47,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:24:47,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:47,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:47,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:47,646 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:24:47,646 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:24:47,646 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:24:47,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:47,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:47,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:47,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:47,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:47,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:47,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:47,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:47,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:47,648 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:47,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:47,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:47,649 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_942545fa-0da5-4a6e-8c22-47a1a17e1adc/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 -> 497bfe83d1a123e7e085e38ee3eed2e663cc023e [2019-10-22 11:24:47,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:47,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:47,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:47,694 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:47,695 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:47,695 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2019-10-22 11:24:47,738 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data/a80252fc8/d1c1e8b740024d98a6819989ad1f7eef/FLAGd4b3207d6 [2019-10-22 11:24:48,163 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:48,164 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/sv-benchmarks/c/forester-heap/dll-optional-1.i [2019-10-22 11:24:48,174 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data/a80252fc8/d1c1e8b740024d98a6819989ad1f7eef/FLAGd4b3207d6 [2019-10-22 11:24:48,523 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data/a80252fc8/d1c1e8b740024d98a6819989ad1f7eef [2019-10-22 11:24:48,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:48,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:48,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:48,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:48,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:48,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711b8bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48, skipping insertion in model container [2019-10-22 11:24:48,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,542 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:48,576 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:48,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:48,904 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:48,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:48,989 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:48,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48 WrapperNode [2019-10-22 11:24:48,990 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:48,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:48,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:48,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:48,998 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:24:48" (1/1) ... [2019-10-22 11:24:49,012 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:24:48" (1/1) ... [2019-10-22 11:24:49,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:49,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:49,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:49,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:49,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:49,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:49,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:49,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:49,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:49,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:49,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:49,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:49,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:49,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:49,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:49,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/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:24:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:24:49,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:24:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:24:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:24:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:24:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:49,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:49,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:49,711 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:49,712 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 11:24:49,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:49 BoogieIcfgContainer [2019-10-22 11:24:49,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:49,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:49,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:49,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:49,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:48" (1/3) ... [2019-10-22 11:24:49,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3375f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:49, skipping insertion in model container [2019-10-22 11:24:49,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (2/3) ... [2019-10-22 11:24:49,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3375f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:49, skipping insertion in model container [2019-10-22 11:24:49,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:49" (3/3) ... [2019-10-22 11:24:49,720 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2019-10-22 11:24:49,729 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:49,736 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-10-22 11:24:49,746 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-10-22 11:24:49,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:49,764 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:24:49,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:49,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:49,765 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:49,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:49,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:49,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:49,790 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-10-22 11:24:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:24:49,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:49,801 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:24:49,803 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:24:49,818 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:49,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219376109] [2019-10-22 11:24:49,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:49,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:49,961 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:24:49,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219376109] [2019-10-22 11:24:49,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:49,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:49,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660990583] [2019-10-22 11:24:49,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:49,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:49,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:49,987 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-10-22 11:24:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,210 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-10-22 11:24:50,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:50,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:24:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,223 INFO L225 Difference]: With dead ends: 149 [2019-10-22 11:24:50,224 INFO L226 Difference]: Without dead ends: 145 [2019-10-22 11:24:50,225 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:24:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-22 11:24:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2019-10-22 11:24:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-22 11:24:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2019-10-22 11:24:50,267 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 3 [2019-10-22 11:24:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,268 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2019-10-22 11:24:50,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2019-10-22 11:24:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:24:50,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,268 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:24:50,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:50,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:24:50,271 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692091676] [2019-10-22 11:24:50,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,301 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:24:50,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692091676] [2019-10-22 11:24:50,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:50,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693437973] [2019-10-22 11:24:50,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:50,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:50,304 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 3 states. [2019-10-22 11:24:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,423 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-10-22 11:24:50,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:50,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:24:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,425 INFO L225 Difference]: With dead ends: 134 [2019-10-22 11:24:50,425 INFO L226 Difference]: Without dead ends: 134 [2019-10-22 11:24:50,426 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:24:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-22 11:24:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-10-22 11:24:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-22 11:24:50,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-10-22 11:24:50,433 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 3 [2019-10-22 11:24:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,433 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-10-22 11:24:50,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-10-22 11:24:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:50,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,434 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,435 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:50,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,435 INFO L82 PathProgramCache]: Analyzing trace with hash 229234793, now seen corresponding path program 1 times [2019-10-22 11:24:50,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465758339] [2019-10-22 11:24:50,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:50,505 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:24:50,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465758339] [2019-10-22 11:24:50,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:50,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:50,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655783642] [2019-10-22 11:24:50,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:50,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:50,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:50,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:50,506 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 5 states. [2019-10-22 11:24:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:50,951 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2019-10-22 11:24:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:50,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 11:24:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:50,953 INFO L225 Difference]: With dead ends: 278 [2019-10-22 11:24:50,954 INFO L226 Difference]: Without dead ends: 278 [2019-10-22 11:24:50,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-22 11:24:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 129. [2019-10-22 11:24:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 11:24:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2019-10-22 11:24:50,962 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 11 [2019-10-22 11:24:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:50,963 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2019-10-22 11:24:50,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2019-10-22 11:24:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:24:50,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:50,964 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:50,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:50,964 INFO L82 PathProgramCache]: Analyzing trace with hash 229234794, now seen corresponding path program 1 times [2019-10-22 11:24:50,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:50,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133435540] [2019-10-22 11:24:50,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:50,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,044 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:24:51,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133435540] [2019-10-22 11:24:51,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:51,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573902252] [2019-10-22 11:24:51,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:51,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:51,046 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand 5 states. [2019-10-22 11:24:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,424 INFO L93 Difference]: Finished difference Result 239 states and 261 transitions. [2019-10-22 11:24:51,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:51,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 11:24:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,426 INFO L225 Difference]: With dead ends: 239 [2019-10-22 11:24:51,426 INFO L226 Difference]: Without dead ends: 239 [2019-10-22 11:24:51,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-22 11:24:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 128. [2019-10-22 11:24:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-22 11:24:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2019-10-22 11:24:51,434 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 11 [2019-10-22 11:24:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,434 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2019-10-22 11:24:51,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2019-10-22 11:24:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:51,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,435 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1383701752, now seen corresponding path program 1 times [2019-10-22 11:24:51,436 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241380925] [2019-10-22 11:24:51,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,522 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:24:51,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241380925] [2019-10-22 11:24:51,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:51,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228011690] [2019-10-22 11:24:51,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:51,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:51,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:51,523 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand 4 states. [2019-10-22 11:24:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:51,694 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-10-22 11:24:51,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:51,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:24:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:51,696 INFO L225 Difference]: With dead ends: 129 [2019-10-22 11:24:51,696 INFO L226 Difference]: Without dead ends: 129 [2019-10-22 11:24:51,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:24:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-22 11:24:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2019-10-22 11:24:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 11:24:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-10-22 11:24:51,708 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 13 [2019-10-22 11:24:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:51,709 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-10-22 11:24:51,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-10-22 11:24:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:24:51,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,710 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:51,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1383701753, now seen corresponding path program 1 times [2019-10-22 11:24:51,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357121319] [2019-10-22 11:24:51,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,837 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:24:51,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357121319] [2019-10-22 11:24:51,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:24:51,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781129033] [2019-10-22 11:24:51,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:51,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:51,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:51,839 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 6 states. [2019-10-22 11:24:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,163 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2019-10-22 11:24:52,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:52,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:24:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,164 INFO L225 Difference]: With dead ends: 175 [2019-10-22 11:24:52,164 INFO L226 Difference]: Without dead ends: 175 [2019-10-22 11:24:52,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:24:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-22 11:24:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2019-10-22 11:24:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-22 11:24:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2019-10-22 11:24:52,174 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 13 [2019-10-22 11:24:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,174 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2019-10-22 11:24:52,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2019-10-22 11:24:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:24:52,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,175 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,175 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1702477093, now seen corresponding path program 1 times [2019-10-22 11:24:52,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216360387] [2019-10-22 11:24:52,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,229 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:24:52,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216360387] [2019-10-22 11:24:52,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630154245] [2019-10-22 11:24:52,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,231 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand 5 states. [2019-10-22 11:24:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,437 INFO L93 Difference]: Finished difference Result 215 states and 251 transitions. [2019-10-22 11:24:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:52,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 11:24:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,439 INFO L225 Difference]: With dead ends: 215 [2019-10-22 11:24:52,439 INFO L226 Difference]: Without dead ends: 215 [2019-10-22 11:24:52,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-22 11:24:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 149. [2019-10-22 11:24:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-22 11:24:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2019-10-22 11:24:52,444 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 15 [2019-10-22 11:24:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,444 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2019-10-22 11:24:52,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2019-10-22 11:24:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:24:52,445 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,445 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,445 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:52,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1702477092, now seen corresponding path program 1 times [2019-10-22 11:24:52,446 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505825249] [2019-10-22 11:24:52,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,502 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:24:52,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505825249] [2019-10-22 11:24:52,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713675976] [2019-10-22 11:24:52,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:52,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:52,503 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand 5 states. [2019-10-22 11:24:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,756 INFO L93 Difference]: Finished difference Result 235 states and 277 transitions. [2019-10-22 11:24:52,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:52,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-22 11:24:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,758 INFO L225 Difference]: With dead ends: 235 [2019-10-22 11:24:52,758 INFO L226 Difference]: Without dead ends: 235 [2019-10-22 11:24:52,758 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-22 11:24:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 148. [2019-10-22 11:24:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-22 11:24:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 172 transitions. [2019-10-22 11:24:52,767 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 172 transitions. Word has length 15 [2019-10-22 11:24:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,767 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 172 transitions. [2019-10-22 11:24:52,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2019-10-22 11:24:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:52,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,768 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:52,768 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,769 INFO L82 PathProgramCache]: Analyzing trace with hash 720321617, now seen corresponding path program 1 times [2019-10-22 11:24:52,769 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782651411] [2019-10-22 11:24:52,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,804 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:24:52,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782651411] [2019-10-22 11:24:52,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:52,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549629038] [2019-10-22 11:24:52,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:52,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:52,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:52,805 INFO L87 Difference]: Start difference. First operand 148 states and 172 transitions. Second operand 4 states. [2019-10-22 11:24:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:52,922 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2019-10-22 11:24:52,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:52,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 11:24:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:52,923 INFO L225 Difference]: With dead ends: 165 [2019-10-22 11:24:52,923 INFO L226 Difference]: Without dead ends: 165 [2019-10-22 11:24:52,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-22 11:24:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2019-10-22 11:24:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-22 11:24:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 170 transitions. [2019-10-22 11:24:52,927 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 170 transitions. Word has length 18 [2019-10-22 11:24:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:52,927 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 170 transitions. [2019-10-22 11:24:52,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 170 transitions. [2019-10-22 11:24:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:24:52,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:52,928 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:24:52,928 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1783315747, now seen corresponding path program 1 times [2019-10-22 11:24:52,929 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:52,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876876878] [2019-10-22 11:24:52,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:52,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:52,993 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:24:52,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876876878] [2019-10-22 11:24:52,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:52,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:52,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470719442] [2019-10-22 11:24:52,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:52,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:52,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:52,995 INFO L87 Difference]: Start difference. First operand 148 states and 170 transitions. Second operand 9 states. [2019-10-22 11:24:53,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,362 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2019-10-22 11:24:53,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:53,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-10-22 11:24:53,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,364 INFO L225 Difference]: With dead ends: 149 [2019-10-22 11:24:53,364 INFO L226 Difference]: Without dead ends: 149 [2019-10-22 11:24:53,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:24:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-22 11:24:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2019-10-22 11:24:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-22 11:24:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2019-10-22 11:24:53,368 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 19 [2019-10-22 11:24:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:53,368 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2019-10-22 11:24:53,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2019-10-22 11:24:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:24:53,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:53,369 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:24:53,369 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:53,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1783315746, now seen corresponding path program 1 times [2019-10-22 11:24:53,370 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:53,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798460173] [2019-10-22 11:24:53,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:53,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:53,474 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:24:53,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798460173] [2019-10-22 11:24:53,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:53,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:24:53,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10453807] [2019-10-22 11:24:53,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:53,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:53,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:53,475 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 10 states. [2019-10-22 11:24:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:54,012 INFO L93 Difference]: Finished difference Result 140 states and 160 transitions. [2019-10-22 11:24:54,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:24:54,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-10-22 11:24:54,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:54,014 INFO L225 Difference]: With dead ends: 140 [2019-10-22 11:24:54,014 INFO L226 Difference]: Without dead ends: 140 [2019-10-22 11:24:54,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:24:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-22 11:24:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2019-10-22 11:24:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 11:24:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2019-10-22 11:24:54,018 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 19 [2019-10-22 11:24:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,018 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2019-10-22 11:24:54,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2019-10-22 11:24:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:54,019 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:54,019 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:24:54,019 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:54,020 INFO L82 PathProgramCache]: Analyzing trace with hash -2075157977, now seen corresponding path program 1 times [2019-10-22 11:24:54,020 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:54,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305990556] [2019-10-22 11:24:54,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,062 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:24:54,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305990556] [2019-10-22 11:24:54,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:54,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741726248] [2019-10-22 11:24:54,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:54,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:54,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:54,064 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 4 states. [2019-10-22 11:24:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:54,085 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2019-10-22 11:24:54,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:54,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-22 11:24:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:54,086 INFO L225 Difference]: With dead ends: 155 [2019-10-22 11:24:54,087 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 11:24:54,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 11:24:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 133. [2019-10-22 11:24:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-22 11:24:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-10-22 11:24:54,091 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 21 [2019-10-22 11:24:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,091 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-10-22 11:24:54,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-10-22 11:24:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:54,093 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:54,093 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, 1, 1] [2019-10-22 11:24:54,094 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1695933988, now seen corresponding path program 1 times [2019-10-22 11:24:54,095 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:54,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898385435] [2019-10-22 11:24:54,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,241 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:24:54,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898385435] [2019-10-22 11:24:54,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:54,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899769724] [2019-10-22 11:24:54,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:24:54,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:24:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:54,243 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 8 states. [2019-10-22 11:24:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:54,555 INFO L93 Difference]: Finished difference Result 246 states and 282 transitions. [2019-10-22 11:24:54,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:54,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-10-22 11:24:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:54,556 INFO L225 Difference]: With dead ends: 246 [2019-10-22 11:24:54,556 INFO L226 Difference]: Without dead ends: 246 [2019-10-22 11:24:54,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-22 11:24:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 147. [2019-10-22 11:24:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-22 11:24:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2019-10-22 11:24:54,560 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 23 [2019-10-22 11:24:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,561 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2019-10-22 11:24:54,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:24:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2019-10-22 11:24:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:54,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:54,563 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, 1, 1] [2019-10-22 11:24:54,563 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:54,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1695933989, now seen corresponding path program 1 times [2019-10-22 11:24:54,564 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:54,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708662251] [2019-10-22 11:24:54,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,564 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,645 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:24:54,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708662251] [2019-10-22 11:24:54,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:24:54,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320538553] [2019-10-22 11:24:54,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:24:54,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:24:54,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:54,646 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 7 states. [2019-10-22 11:24:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:55,000 INFO L93 Difference]: Finished difference Result 258 states and 296 transitions. [2019-10-22 11:24:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 11:24:55,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-22 11:24:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:55,001 INFO L225 Difference]: With dead ends: 258 [2019-10-22 11:24:55,002 INFO L226 Difference]: Without dead ends: 258 [2019-10-22 11:24:55,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:24:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-22 11:24:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 143. [2019-10-22 11:24:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:24:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2019-10-22 11:24:55,007 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 23 [2019-10-22 11:24:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:55,007 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2019-10-22 11:24:55,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:24:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2019-10-22 11:24:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:55,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:55,008 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, 1, 1, 1, 1, 1] [2019-10-22 11:24:55,008 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:55,009 INFO L82 PathProgramCache]: Analyzing trace with hash 250646373, now seen corresponding path program 1 times [2019-10-22 11:24:55,009 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:55,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648141114] [2019-10-22 11:24:55,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:55,009 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:55,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:55,107 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:24:55,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648141114] [2019-10-22 11:24:55,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:55,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:24:55,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573345000] [2019-10-22 11:24:55,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:55,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:55,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:55,109 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand 9 states. [2019-10-22 11:24:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:55,770 INFO L93 Difference]: Finished difference Result 392 states and 448 transitions. [2019-10-22 11:24:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:24:55,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-10-22 11:24:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:55,772 INFO L225 Difference]: With dead ends: 392 [2019-10-22 11:24:55,772 INFO L226 Difference]: Without dead ends: 392 [2019-10-22 11:24:55,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-10-22 11:24:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-22 11:24:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 156. [2019-10-22 11:24:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 11:24:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2019-10-22 11:24:55,777 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 26 [2019-10-22 11:24:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:55,777 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2019-10-22 11:24:55,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2019-10-22 11:24:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:55,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:55,778 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, 1, 1, 1, 1, 1] [2019-10-22 11:24:55,778 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:55,779 INFO L82 PathProgramCache]: Analyzing trace with hash 250646374, now seen corresponding path program 1 times [2019-10-22 11:24:55,779 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:55,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239573315] [2019-10-22 11:24:55,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:55,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:55,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:55,939 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:24:55,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239573315] [2019-10-22 11:24:55,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:55,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:24:55,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531964051] [2019-10-22 11:24:55,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:24:55,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:24:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:55,941 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand 11 states. [2019-10-22 11:24:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:56,559 INFO L93 Difference]: Finished difference Result 311 states and 357 transitions. [2019-10-22 11:24:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 11:24:56,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-10-22 11:24:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:56,560 INFO L225 Difference]: With dead ends: 311 [2019-10-22 11:24:56,560 INFO L226 Difference]: Without dead ends: 311 [2019-10-22 11:24:56,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:24:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-22 11:24:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 156. [2019-10-22 11:24:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-22 11:24:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2019-10-22 11:24:56,566 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 26 [2019-10-22 11:24:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:56,566 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2019-10-22 11:24:56,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:24:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2019-10-22 11:24:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:56,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:56,567 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, 1, 1, 1, 1, 1] [2019-10-22 11:24:56,567 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1247589301, now seen corresponding path program 1 times [2019-10-22 11:24:56,568 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:56,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743770849] [2019-10-22 11:24:56,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:56,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:56,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:56,608 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:24:56,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743770849] [2019-10-22 11:24:56,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:56,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:56,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647639558] [2019-10-22 11:24:56,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:56,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:56,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:56,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:56,610 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand 5 states. [2019-10-22 11:24:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:56,873 INFO L93 Difference]: Finished difference Result 255 states and 295 transitions. [2019-10-22 11:24:56,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:56,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 11:24:56,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:56,875 INFO L225 Difference]: With dead ends: 255 [2019-10-22 11:24:56,875 INFO L226 Difference]: Without dead ends: 255 [2019-10-22 11:24:56,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-22 11:24:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 155. [2019-10-22 11:24:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-22 11:24:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2019-10-22 11:24:56,878 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 26 [2019-10-22 11:24:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:56,878 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2019-10-22 11:24:56,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2019-10-22 11:24:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:56,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:56,879 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, 1, 1, 1, 1, 1] [2019-10-22 11:24:56,879 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:56,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1247589302, now seen corresponding path program 1 times [2019-10-22 11:24:56,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:56,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381976346] [2019-10-22 11:24:56,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:56,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:56,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:56,916 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:24:56,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381976346] [2019-10-22 11:24:56,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:56,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:56,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688759896] [2019-10-22 11:24:56,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:56,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:56,918 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand 5 states. [2019-10-22 11:24:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:57,151 INFO L93 Difference]: Finished difference Result 263 states and 308 transitions. [2019-10-22 11:24:57,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:57,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-22 11:24:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:57,152 INFO L225 Difference]: With dead ends: 263 [2019-10-22 11:24:57,152 INFO L226 Difference]: Without dead ends: 263 [2019-10-22 11:24:57,152 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:24:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-22 11:24:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 154. [2019-10-22 11:24:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-22 11:24:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2019-10-22 11:24:57,155 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 26 [2019-10-22 11:24:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:57,156 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2019-10-22 11:24:57,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2019-10-22 11:24:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:24:57,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:57,156 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, 1, 1, 1] [2019-10-22 11:24:57,157 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1399219461, now seen corresponding path program 1 times [2019-10-22 11:24:57,157 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:57,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430841392] [2019-10-22 11:24:57,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:57,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:57,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:57,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430841392] [2019-10-22 11:24:57,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:57,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:57,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715117999] [2019-10-22 11:24:57,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:57,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:57,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:57,183 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand 4 states. [2019-10-22 11:24:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:57,198 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2019-10-22 11:24:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:57,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-22 11:24:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:57,199 INFO L225 Difference]: With dead ends: 165 [2019-10-22 11:24:57,199 INFO L226 Difference]: Without dead ends: 165 [2019-10-22 11:24:57,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-22 11:24:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2019-10-22 11:24:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-22 11:24:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 184 transitions. [2019-10-22 11:24:57,202 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 184 transitions. Word has length 27 [2019-10-22 11:24:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:57,202 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 184 transitions. [2019-10-22 11:24:57,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2019-10-22 11:24:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:24:57,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:57,203 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, 1, 1, 1, 1, 1] [2019-10-22 11:24:57,203 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:24:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1301067616, now seen corresponding path program 1 times [2019-10-22 11:24:57,204 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:57,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788474382] [2019-10-22 11:24:57,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:57,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:57,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:57,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788474382] [2019-10-22 11:24:57,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753876946] [2019-10-22 11:24:57,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/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:24:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:57,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-22 11:24:57,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:57,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:24:57,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,435 INFO L567 ElimStorePlain]: treesize reduction 3, result has 88.0 percent of original size [2019-10-22 11:24:57,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:24:57,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-10-22 11:24:57,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-22 11:24:57,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,488 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.9 percent of original size [2019-10-22 11:24:57,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-10-22 11:24:57,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2019-10-22 11:24:57,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-22 11:24:57,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-22 11:24:57,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,569 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2019-10-22 11:24:57,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-22 11:24:57,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,610 INFO L567 ElimStorePlain]: treesize reduction 5, result has 92.1 percent of original size [2019-10-22 11:24:57,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:57,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-10-22 11:24:57,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,636 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:54 [2019-10-22 11:24:57,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-22 11:24:57,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,717 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-10-22 11:24:57,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-10-22 11:24:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:57,730 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:57,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:57,779 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:24:57,783 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,803 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:57,808 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-22 11:24:57,820 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:57 [2019-10-22 11:24:57,880 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 35 treesize of output 33 [2019-10-22 11:24:57,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:24:57,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:24:57,886 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:24:57,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:24:57,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:57,890 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,891 INFO L567 ElimStorePlain]: treesize reduction 34, result has 2.9 percent of original size [2019-10-22 11:24:57,891 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-10-22 11:24:57,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:57,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:1 [2019-10-22 11:24:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:57,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2133727265] [2019-10-22 11:24:57,903 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 30 [2019-10-22 11:24:57,948 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:24:57,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:24:58,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:58,253 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:24:58,259 INFO L168 Benchmark]: Toolchain (without parser) took 9731.44 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 163.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,259 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:58,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.97 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,260 INFO L168 Benchmark]: Boogie Preprocessor took 29.76 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,261 INFO L168 Benchmark]: RCFGBuilder took 649.43 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,261 INFO L168 Benchmark]: TraceAbstraction took 8544.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.6 MB). Peak memory consumption was 154.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:58,267 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 461.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.97 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.76 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 649.43 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: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8544.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -11.6 MB). Peak memory consumption was 154.6 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:25:00,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:00,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:00,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:00,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:00,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:00,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:00,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:00,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:00,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:00,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:00,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:00,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:00,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:00,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:00,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:00,303 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:00,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:00,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:00,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:00,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:00,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:00,310 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:00,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:00,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:00,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:00,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:00,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:00,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:00,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:00,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:00,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:00,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:00,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:00,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:00,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:00,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:00,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:00,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:00,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:00,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:00,322 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:25:00,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:00,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:00,340 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:00,341 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:00,341 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:00,341 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:00,341 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:00,341 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:00,341 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:00,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:25:00,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:25:00,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:00,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:00,343 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:25:00,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:00,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:00,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:00,343 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:25:00,343 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:25:00,343 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:25:00,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:00,344 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:25:00,344 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:25:00,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:00,344 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:25:00,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:00,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:00,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:00,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:00,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:00,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:00,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:00,346 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:25:00,346 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:25:00,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:00,346 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_942545fa-0da5-4a6e-8c22-47a1a17e1adc/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 -> 497bfe83d1a123e7e085e38ee3eed2e663cc023e [2019-10-22 11:25:00,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:00,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:00,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:00,386 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:00,387 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:00,387 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2019-10-22 11:25:00,438 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data/35c28e453/56dc9629ff2c43f88c9a226170e3ccf8/FLAGb0bcbaa0b [2019-10-22 11:25:00,881 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:00,882 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/sv-benchmarks/c/forester-heap/dll-optional-1.i [2019-10-22 11:25:00,890 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data/35c28e453/56dc9629ff2c43f88c9a226170e3ccf8/FLAGb0bcbaa0b [2019-10-22 11:25:00,902 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/bin/utaipan/data/35c28e453/56dc9629ff2c43f88c9a226170e3ccf8 [2019-10-22 11:25:00,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:00,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:00,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:00,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:00,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:00,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:00" (1/1) ... [2019-10-22 11:25:00,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1793d380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:00, skipping insertion in model container [2019-10-22 11:25:00,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:00" (1/1) ... [2019-10-22 11:25:00,919 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:00,955 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:01,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:01,259 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:01,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:01,339 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:01,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01 WrapperNode [2019-10-22 11:25:01,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:01,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:01,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:01,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:01,348 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:25:01" (1/1) ... [2019-10-22 11:25:01,370 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:25:01" (1/1) ... [2019-10-22 11:25:01,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:01,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:01,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:01,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:01,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (1/1) ... [2019-10-22 11:25:01,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:01,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:01,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:01,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:01,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/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:25:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:25:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:25:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:25:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:25:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:25:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:25:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:01,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:02,249 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:02,249 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 11:25:02,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:02 BoogieIcfgContainer [2019-10-22 11:25:02,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:02,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:02,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:02,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:02,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:00" (1/3) ... [2019-10-22 11:25:02,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7e19d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:02, skipping insertion in model container [2019-10-22 11:25:02,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:01" (2/3) ... [2019-10-22 11:25:02,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7e19d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:02, skipping insertion in model container [2019-10-22 11:25:02,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:02" (3/3) ... [2019-10-22 11:25:02,258 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2019-10-22 11:25:02,267 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:02,274 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-10-22 11:25:02,284 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-10-22 11:25:02,302 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:02,302 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:25:02,302 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:02,302 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:02,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:02,303 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:02,303 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:02,303 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-10-22 11:25:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:25:02,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:02,327 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:25:02,329 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION]=== [2019-10-22 11:25:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:25:02,343 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:25:02,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [919962252] [2019-10-22 11:25:02,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_942545fa-0da5-4a6e-8c22-47a1a17e1adc/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:25:02,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:02,580 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:25:02,585 INFO L168 Benchmark]: Toolchain (without parser) took 1678.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -99.9 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:02,585 INFO L168 Benchmark]: CDTParser took 0.16 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:25:02,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:02,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.39 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:25:02,587 INFO L168 Benchmark]: Boogie Preprocessor took 58.80 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:02,588 INFO L168 Benchmark]: RCFGBuilder took 795.70 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: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:02,588 INFO L168 Benchmark]: TraceAbstraction took 331.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:02,591 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.16 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 433.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.39 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. * Boogie Preprocessor took 58.80 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 795.70 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: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 331.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 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...