./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-reverse.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_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/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 333a0564072dd31bf7e82e165661bf94788e3c7f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/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 333a0564072dd31bf7e82e165661bf94788e3c7f ...................................................................................................................................................................................................................................................... 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:21:01,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:01,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:01,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:01,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:01,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:01,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:01,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:01,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:01,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:01,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:01,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:01,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:01,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:01,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:01,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:01,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:01,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:01,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:01,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:01,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:01,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:01,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:01,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:01,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:01,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:01,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:01,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:01,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:01,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:01,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:01,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:01,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:01,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:01,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:01,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:01,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:01,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:01,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:01,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:01,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:01,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:21:01,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:01,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:01,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:01,849 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:01,849 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:01,850 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:01,850 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:01,850 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:01,850 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:01,850 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:01,850 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:01,850 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:01,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:21:01,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:21:01,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:01,851 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:01,852 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:21:01,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:01,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:01,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:01,852 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:21:01,852 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:21:01,852 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:21:01,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:01,853 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:01,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:01,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:01,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:01,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:01,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:01,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:01,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:01,855 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:01,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:01,855 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:01,856 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_f01093a9-8e47-45f7-9b37-375d475c4791/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 -> 333a0564072dd31bf7e82e165661bf94788e3c7f [2019-10-22 11:21:01,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:01,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:01,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:01,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:01,905 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:01,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-reverse.i [2019-10-22 11:21:01,954 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data/734b36c75/39c254be5d83419ab784f0efbe7f5e73/FLAGe4b4d176b [2019-10-22 11:21:02,407 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:02,407 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/sv-benchmarks/c/forester-heap/dll-reverse.i [2019-10-22 11:21:02,416 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data/734b36c75/39c254be5d83419ab784f0efbe7f5e73/FLAGe4b4d176b [2019-10-22 11:21:02,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data/734b36c75/39c254be5d83419ab784f0efbe7f5e73 [2019-10-22 11:21:02,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:02,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:02,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:02,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:02,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:02,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e86ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02, skipping insertion in model container [2019-10-22 11:21:02,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,951 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:02,992 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:03,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:03,341 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:03,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:03,423 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:03,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03 WrapperNode [2019-10-22 11:21:03,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:03,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:03,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:03,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:03,432 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:21:03" (1/1) ... [2019-10-22 11:21:03,445 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:21:03" (1/1) ... [2019-10-22 11:21:03,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:03,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:03,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:03,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:03,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:03,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:03,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:03,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:03,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/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:21:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:21:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:21:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:03,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:03,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:04,078 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:04,078 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 11:21:04,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:04 BoogieIcfgContainer [2019-10-22 11:21:04,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:04,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:04,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:04,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:04,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:02" (1/3) ... [2019-10-22 11:21:04,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736e1790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:04, skipping insertion in model container [2019-10-22 11:21:04,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (2/3) ... [2019-10-22 11:21:04,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736e1790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:04, skipping insertion in model container [2019-10-22 11:21:04,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:04" (3/3) ... [2019-10-22 11:21:04,089 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2019-10-22 11:21:04,097 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:04,104 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 66 error locations. [2019-10-22 11:21:04,115 INFO L249 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2019-10-22 11:21:04,133 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:04,133 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:21:04,133 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:04,133 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:04,133 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:04,133 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:04,137 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:04,137 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-10-22 11:21:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:21:04,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,166 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:21:04,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:21:04,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507185028] [2019-10-22 11:21:04,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,320 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:21:04,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507185028] [2019-10-22 11:21:04,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:04,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972847284] [2019-10-22 11:21:04,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,345 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-10-22 11:21:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,518 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-22 11:21:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:21:04,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,529 INFO L225 Difference]: With dead ends: 138 [2019-10-22 11:21:04,529 INFO L226 Difference]: Without dead ends: 136 [2019-10-22 11:21:04,530 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:21:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-22 11:21:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-10-22 11:21:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-22 11:21:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-10-22 11:21:04,564 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 3 [2019-10-22 11:21:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,565 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-10-22 11:21:04,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-10-22 11:21:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:21:04,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,566 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:21:04,566 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:21:04,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437202240] [2019-10-22 11:21:04,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,612 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:21:04,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437202240] [2019-10-22 11:21:04,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:04,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018643923] [2019-10-22 11:21:04,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,615 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 3 states. [2019-10-22 11:21:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,738 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2019-10-22 11:21:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:21:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,740 INFO L225 Difference]: With dead ends: 133 [2019-10-22 11:21:04,740 INFO L226 Difference]: Without dead ends: 133 [2019-10-22 11:21:04,741 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:21:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-22 11:21:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-22 11:21:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-22 11:21:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2019-10-22 11:21:04,749 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 3 [2019-10-22 11:21:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,749 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2019-10-22 11:21:04,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2019-10-22 11:21:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:21:04,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:04,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2019-10-22 11:21:04,751 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120120171] [2019-10-22 11:21:04,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,814 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:21:04,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120120171] [2019-10-22 11:21:04,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:04,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124538588] [2019-10-22 11:21:04,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:04,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:04,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:04,817 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2019-10-22 11:21:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,062 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-10-22 11:21:05,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:05,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:21:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,063 INFO L225 Difference]: With dead ends: 124 [2019-10-22 11:21:05,063 INFO L226 Difference]: Without dead ends: 124 [2019-10-22 11:21:05,063 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:21:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-22 11:21:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-10-22 11:21:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-22 11:21:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2019-10-22 11:21:05,074 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 9 [2019-10-22 11:21:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,074 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2019-10-22 11:21:05,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2019-10-22 11:21:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:21:05,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,075 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,075 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2019-10-22 11:21:05,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372806942] [2019-10-22 11:21:05,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,175 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:21:05,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372806942] [2019-10-22 11:21:05,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:05,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098145809] [2019-10-22 11:21:05,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:05,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:05,177 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 4 states. [2019-10-22 11:21:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,445 INFO L93 Difference]: Finished difference Result 162 states and 176 transitions. [2019-10-22 11:21:05,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:05,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:21:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,447 INFO L225 Difference]: With dead ends: 162 [2019-10-22 11:21:05,447 INFO L226 Difference]: Without dead ends: 162 [2019-10-22 11:21:05,447 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:21:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-22 11:21:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 147. [2019-10-22 11:21:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-22 11:21:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2019-10-22 11:21:05,462 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 9 [2019-10-22 11:21:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,463 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2019-10-22 11:21:05,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2019-10-22 11:21:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:21:05,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,464 INFO L82 PathProgramCache]: Analyzing trace with hash 233113581, now seen corresponding path program 1 times [2019-10-22 11:21:05,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184775026] [2019-10-22 11:21:05,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,544 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:21:05,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184775026] [2019-10-22 11:21:05,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:05,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993143338] [2019-10-22 11:21:05,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:05,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:05,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:05,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:05,546 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand 5 states. [2019-10-22 11:21:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,947 INFO L93 Difference]: Finished difference Result 262 states and 293 transitions. [2019-10-22 11:21:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:05,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 11:21:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,949 INFO L225 Difference]: With dead ends: 262 [2019-10-22 11:21:05,949 INFO L226 Difference]: Without dead ends: 262 [2019-10-22 11:21:05,949 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:21:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-22 11:21:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 146. [2019-10-22 11:21:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 11:21:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2019-10-22 11:21:05,968 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 11 [2019-10-22 11:21:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,968 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2019-10-22 11:21:05,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2019-10-22 11:21:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:21:05,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,969 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,969 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,969 INFO L82 PathProgramCache]: Analyzing trace with hash 233113582, now seen corresponding path program 1 times [2019-10-22 11:21:05,969 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288456057] [2019-10-22 11:21:05,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:06,056 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:21:06,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288456057] [2019-10-22 11:21:06,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:06,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:06,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834285281] [2019-10-22 11:21:06,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:06,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:06,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:06,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:06,058 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand 5 states. [2019-10-22 11:21:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:06,398 INFO L93 Difference]: Finished difference Result 261 states and 291 transitions. [2019-10-22 11:21:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:06,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-22 11:21:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:06,399 INFO L225 Difference]: With dead ends: 261 [2019-10-22 11:21:06,399 INFO L226 Difference]: Without dead ends: 261 [2019-10-22 11:21:06,400 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:21:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-22 11:21:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 145. [2019-10-22 11:21:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-22 11:21:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2019-10-22 11:21:06,406 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 11 [2019-10-22 11:21:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:06,407 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2019-10-22 11:21:06,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2019-10-22 11:21:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:21:06,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:06,407 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:06,408 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash 51789359, now seen corresponding path program 1 times [2019-10-22 11:21:06,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:06,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095507342] [2019-10-22 11:21:06,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:06,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:06,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:06,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:21:06,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095507342] [2019-10-22 11:21:06,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:06,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:21:06,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85782545] [2019-10-22 11:21:06,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:06,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:06,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:06,524 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand 9 states. [2019-10-22 11:21:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:06,841 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2019-10-22 11:21:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:06,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-10-22 11:21:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:06,842 INFO L225 Difference]: With dead ends: 146 [2019-10-22 11:21:06,842 INFO L226 Difference]: Without dead ends: 146 [2019-10-22 11:21:06,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:21:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-22 11:21:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-10-22 11:21:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-22 11:21:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2019-10-22 11:21:06,847 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 15 [2019-10-22 11:21:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:06,847 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2019-10-22 11:21:06,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2019-10-22 11:21:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:21:06,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:06,858 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:06,858 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:06,859 INFO L82 PathProgramCache]: Analyzing trace with hash 51789360, now seen corresponding path program 1 times [2019-10-22 11:21:06,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:06,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942741148] [2019-10-22 11:21:06,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:06,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:06,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:07,002 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:21:07,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942741148] [2019-10-22 11:21:07,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:07,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:07,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99163909] [2019-10-22 11:21:07,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:07,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:07,004 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand 10 states. [2019-10-22 11:21:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:07,687 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2019-10-22 11:21:07,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:21:07,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-10-22 11:21:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:07,688 INFO L225 Difference]: With dead ends: 143 [2019-10-22 11:21:07,688 INFO L226 Difference]: Without dead ends: 143 [2019-10-22 11:21:07,689 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:21:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-22 11:21:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2019-10-22 11:21:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 11:21:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2019-10-22 11:21:07,692 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 15 [2019-10-22 11:21:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:07,692 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2019-10-22 11:21:07,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2019-10-22 11:21:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:07,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:07,693 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:21:07,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash 85825600, now seen corresponding path program 1 times [2019-10-22 11:21:07,694 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:07,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988558580] [2019-10-22 11:21:07,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:07,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:07,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:07,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988558580] [2019-10-22 11:21:07,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:07,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:07,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873913062] [2019-10-22 11:21:07,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:07,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:07,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:07,775 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand 6 states. [2019-10-22 11:21:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:07,988 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2019-10-22 11:21:07,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:07,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-22 11:21:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:07,989 INFO L225 Difference]: With dead ends: 153 [2019-10-22 11:21:07,989 INFO L226 Difference]: Without dead ends: 153 [2019-10-22 11:21:07,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-22 11:21:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2019-10-22 11:21:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 11:21:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2019-10-22 11:21:07,993 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 18 [2019-10-22 11:21:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:07,993 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2019-10-22 11:21:07,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2019-10-22 11:21:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:21:08,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,000 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] [2019-10-22 11:21:08,000 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1064569786, now seen corresponding path program 1 times [2019-10-22 11:21:08,001 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:08,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324113029] [2019-10-22 11:21:08,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,066 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:21:08,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324113029] [2019-10-22 11:21:08,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:08,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:08,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709552317] [2019-10-22 11:21:08,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:08,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:08,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:08,067 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 6 states. [2019-10-22 11:21:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,226 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2019-10-22 11:21:08,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:08,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-22 11:21:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,227 INFO L225 Difference]: With dead ends: 157 [2019-10-22 11:21:08,228 INFO L226 Difference]: Without dead ends: 157 [2019-10-22 11:21:08,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-22 11:21:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2019-10-22 11:21:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-22 11:21:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2019-10-22 11:21:08,231 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 20 [2019-10-22 11:21:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,231 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2019-10-22 11:21:08,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2019-10-22 11:21:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:21:08,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,232 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:21:08,232 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1358752139, now seen corresponding path program 1 times [2019-10-22 11:21:08,233 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:08,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228121631] [2019-10-22 11:21:08,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,273 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:21:08,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228121631] [2019-10-22 11:21:08,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:08,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:08,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727908353] [2019-10-22 11:21:08,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:08,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:08,274 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand 5 states. [2019-10-22 11:21:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,464 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2019-10-22 11:21:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:08,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-22 11:21:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,466 INFO L225 Difference]: With dead ends: 206 [2019-10-22 11:21:08,466 INFO L226 Difference]: Without dead ends: 206 [2019-10-22 11:21:08,466 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:21:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-10-22 11:21:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 149. [2019-10-22 11:21:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-22 11:21:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2019-10-22 11:21:08,471 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 21 [2019-10-22 11:21:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,471 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2019-10-22 11:21:08,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2019-10-22 11:21:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:21:08,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,472 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:21:08,472 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1358752138, now seen corresponding path program 1 times [2019-10-22 11:21:08,473 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:08,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038466577] [2019-10-22 11:21:08,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,536 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:21:08,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038466577] [2019-10-22 11:21:08,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:08,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:08,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929444250] [2019-10-22 11:21:08,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:08,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:08,538 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 5 states. [2019-10-22 11:21:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,748 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2019-10-22 11:21:08,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:08,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-22 11:21:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,749 INFO L225 Difference]: With dead ends: 205 [2019-10-22 11:21:08,749 INFO L226 Difference]: Without dead ends: 205 [2019-10-22 11:21:08,750 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:21:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-22 11:21:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 148. [2019-10-22 11:21:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-22 11:21:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2019-10-22 11:21:08,752 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 21 [2019-10-22 11:21:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,753 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2019-10-22 11:21:08,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2019-10-22 11:21:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:21:08,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,757 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] [2019-10-22 11:21:08,757 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1306259657, now seen corresponding path program 1 times [2019-10-22 11:21:08,758 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:08,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129741301] [2019-10-22 11:21:08,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:08,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,853 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:21:08,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129741301] [2019-10-22 11:21:08,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:08,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:21:08,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300509512] [2019-10-22 11:21:08,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:08,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:08,855 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand 9 states. [2019-10-22 11:21:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:09,098 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2019-10-22 11:21:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:09,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-22 11:21:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:09,100 INFO L225 Difference]: With dead ends: 149 [2019-10-22 11:21:09,100 INFO L226 Difference]: Without dead ends: 149 [2019-10-22 11:21:09,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:21:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-22 11:21:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2019-10-22 11:21:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-22 11:21:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 163 transitions. [2019-10-22 11:21:09,104 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 163 transitions. Word has length 25 [2019-10-22 11:21:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:09,104 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 163 transitions. [2019-10-22 11:21:09,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 163 transitions. [2019-10-22 11:21:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:21:09,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:09,105 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] [2019-10-22 11:21:09,105 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1306259656, now seen corresponding path program 1 times [2019-10-22 11:21:09,105 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:09,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979857508] [2019-10-22 11:21:09,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,109 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:09,228 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:21:09,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979857508] [2019-10-22 11:21:09,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:09,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:09,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729393627] [2019-10-22 11:21:09,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:09,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:09,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:09,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:09,230 INFO L87 Difference]: Start difference. First operand 147 states and 163 transitions. Second operand 10 states. [2019-10-22 11:21:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:09,621 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2019-10-22 11:21:09,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:21:09,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-22 11:21:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:09,622 INFO L225 Difference]: With dead ends: 148 [2019-10-22 11:21:09,622 INFO L226 Difference]: Without dead ends: 148 [2019-10-22 11:21:09,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:21:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-22 11:21:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2019-10-22 11:21:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-22 11:21:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2019-10-22 11:21:09,625 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 25 [2019-10-22 11:21:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:09,626 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2019-10-22 11:21:09,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2019-10-22 11:21:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:21:09,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:09,627 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] [2019-10-22 11:21:09,627 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION]=== [2019-10-22 11:21:09,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2032582513, now seen corresponding path program 1 times [2019-10-22 11:21:09,627 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:09,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994615336] [2019-10-22 11:21:09,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,628 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:09,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994615336] [2019-10-22 11:21:09,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158777052] [2019-10-22 11:21:09,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/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:21:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:09,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-22 11:21:09,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:09,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:09,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 11:21:09,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:09,908 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-10-22 11:21:09,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:09,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-10-22 11:21:09,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:21:09,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:09,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:09,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:09,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-10-22 11:21:10,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:10,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-10-22 11:21:10,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:10,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 11:21:10,051 INFO L567 ElimStorePlain]: treesize reduction 39, result has 52.4 percent of original size [2019-10-22 11:21:10,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:10,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-10-22 11:21:10,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:10,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 110 [2019-10-22 11:21:10,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:10,215 INFO L567 ElimStorePlain]: treesize reduction 54, result has 44.9 percent of original size [2019-10-22 11:21:10,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:10,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2019-10-22 11:21:10,267 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-22 11:21:10,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 79 [2019-10-22 11:21:10,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:10,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:10,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:10,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-22 11:21:10,289 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-10-22 11:21:10,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:10,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-10-22 11:21:10,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:10,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-10-22 11:21:10,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:10,375 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-10-22 11:21:10,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:10,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-10-22 11:21:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:10,430 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:10,442 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:21:10,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:10,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:10,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-10-22 11:21:26,840 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 4061 treesize of output 4045 [2019-10-22 11:21:26,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:26,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:26,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,101 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:21:27,608 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 [2019-10-22 11:21:27,609 INFO L567 ElimStorePlain]: treesize reduction 3893, result has 3.8 percent of original size [2019-10-22 11:21:27,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:27,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:27,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 140 dim-0 vars, and 9 xjuncts. [2019-10-22 11:21:27,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:134, output treesize:3149 [2019-10-22 11:21:28,195 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 927 DAG size of output: 30 [2019-10-22 11:21:28,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:21:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:28,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1173770918] [2019-10-22 11:21:28,320 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 29 [2019-10-22 11:21:28,363 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:21:28,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:21:28,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:28,666 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:21:28,670 INFO L168 Benchmark]: Toolchain (without parser) took 25739.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 944.5 MB in the beginning and 921.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,670 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:28,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:28,671 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,672 INFO L168 Benchmark]: RCFGBuilder took 583.03 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,672 INFO L168 Benchmark]: TraceAbstraction took 24588.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 921.7 MB in the end (delta: 145.1 MB). Peak memory consumption was 208.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,679 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.91 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 583.03 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24588.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 921.7 MB in the end (delta: 145.1 MB). Peak memory consumption was 208.5 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:21:30,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:30,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:30,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:30,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:30,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:30,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:30,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:30,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:30,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:30,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:30,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:30,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:30,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:30,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:30,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:30,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:30,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:30,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:30,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:30,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:30,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:30,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:30,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:30,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:30,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:30,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:30,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:30,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:30,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:30,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:30,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:30,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:30,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:30,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:30,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:30,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:30,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:30,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:30,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:30,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:30,867 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:21:30,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:30,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:30,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:30,879 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:30,879 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:30,879 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:30,879 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:30,880 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:30,880 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:30,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:21:30,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:21:30,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:30,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:30,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:21:30,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:30,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:30,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:30,881 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:21:30,881 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:21:30,882 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:21:30,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:30,882 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:21:30,882 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:21:30,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:30,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:21:30,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:30,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:30,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:30,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:30,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:30,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:30,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:30,884 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:21:30,884 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:21:30,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:30,884 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_f01093a9-8e47-45f7-9b37-375d475c4791/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 -> 333a0564072dd31bf7e82e165661bf94788e3c7f [2019-10-22 11:21:30,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:30,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:30,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:30,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:30,923 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:30,924 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-reverse.i [2019-10-22 11:21:30,977 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data/06ea66ec2/a004d47c04864442b8f4f1e729dfe34f/FLAGb1aa1e820 [2019-10-22 11:21:31,439 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:31,439 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/sv-benchmarks/c/forester-heap/dll-reverse.i [2019-10-22 11:21:31,454 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data/06ea66ec2/a004d47c04864442b8f4f1e729dfe34f/FLAGb1aa1e820 [2019-10-22 11:21:31,733 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/bin/utaipan/data/06ea66ec2/a004d47c04864442b8f4f1e729dfe34f [2019-10-22 11:21:31,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:31,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:31,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:31,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:31,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:31,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77803eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:31, skipping insertion in model container [2019-10-22 11:21:31,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:31" (1/1) ... [2019-10-22 11:21:31,750 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:31,785 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:32,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:32,097 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:32,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:32,268 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:32,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32 WrapperNode [2019-10-22 11:21:32,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:32,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:32,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:32,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:32,277 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:21:32" (1/1) ... [2019-10-22 11:21:32,297 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:21:32" (1/1) ... [2019-10-22 11:21:32,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:32,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:32,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:32,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:32,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (1/1) ... [2019-10-22 11:21:32,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (1/1) ... [2019-10-22 11:21:32,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (1/1) ... [2019-10-22 11:21:32,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (1/1) ... [2019-10-22 11:21:32,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (1/1) ... [2019-10-22 11:21:32,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (1/1) ... [2019-10-22 11:21:32,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (1/1) ... [2019-10-22 11:21:32,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:32,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:32,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:32,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:32,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/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:21:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:21:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:21:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:32,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:33,137 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:33,137 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 11:21:33,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:33 BoogieIcfgContainer [2019-10-22 11:21:33,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:33,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:33,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:33,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:33,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:31" (1/3) ... [2019-10-22 11:21:33,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e9a9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:33, skipping insertion in model container [2019-10-22 11:21:33,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:32" (2/3) ... [2019-10-22 11:21:33,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e9a9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:33, skipping insertion in model container [2019-10-22 11:21:33,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:33" (3/3) ... [2019-10-22 11:21:33,150 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2019-10-22 11:21:33,163 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:33,173 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 66 error locations. [2019-10-22 11:21:33,182 INFO L249 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2019-10-22 11:21:33,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:33,199 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:21:33,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:33,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:33,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:33,200 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:33,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:33,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-10-22 11:21:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:21:33,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:33,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:21:33,223 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION]=== [2019-10-22 11:21:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:21:33,236 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:33,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [66046226] [2019-10-22 11:21:33,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f01093a9-8e47-45f7-9b37-375d475c4791/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:21:33,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:33,478 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:21:33,482 INFO L168 Benchmark]: Toolchain (without parser) took 1745.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -131.4 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:33,483 INFO L168 Benchmark]: CDTParser took 0.18 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:21:33,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -204.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:33,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:33,485 INFO L168 Benchmark]: Boogie Preprocessor took 33.65 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:33,485 INFO L168 Benchmark]: RCFGBuilder took 782.40 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:33,487 INFO L168 Benchmark]: TraceAbstraction took 339.79 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: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:33,490 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.18 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 531.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -204.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.65 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 782.40 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 339.79 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: 19.8 MB). Peak memory consumption was 19.8 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...