./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/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 811c06b4616c360d68e825b8fa9e0b4596e5faf8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/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 811c06b4616c360d68e825b8fa9e0b4596e5faf8 ...................................................................................................................................................................................................................................................... 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:22:07,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:07,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:07,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:07,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:07,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:07,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:07,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:07,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:07,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:07,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:07,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:07,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:07,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:07,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:07,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:07,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:07,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:07,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:07,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:07,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:07,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:07,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:07,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:07,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:07,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:07,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:07,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:07,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:07,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:07,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:07,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:07,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:07,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:07,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:07,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:07,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:07,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:07,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:07,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:07,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:07,229 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:22:07,239 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:07,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:07,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:07,240 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:07,240 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:07,240 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:07,240 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:07,240 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:07,240 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:07,241 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:07,241 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:07,241 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:07,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:22:07,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:22:07,242 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:07,242 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:07,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:22:07,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:07,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:07,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:07,243 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:22:07,243 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:22:07,243 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:22:07,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:07,244 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:07,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:07,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:07,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:07,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:07,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:07,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:07,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:07,245 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:07,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:07,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:07,246 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_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/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 -> 811c06b4616c360d68e825b8fa9e0b4596e5faf8 [2019-10-22 11:22:07,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:07,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:07,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:07,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:07,295 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:07,296 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-10-22 11:22:07,347 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data/a59b4e94a/44abeff879ea49d787a942f4b255c723/FLAG9b9f6eb39 [2019-10-22 11:22:07,792 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:07,793 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-10-22 11:22:07,803 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data/a59b4e94a/44abeff879ea49d787a942f4b255c723/FLAG9b9f6eb39 [2019-10-22 11:22:07,814 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data/a59b4e94a/44abeff879ea49d787a942f4b255c723 [2019-10-22 11:22:07,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:07,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:07,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:07,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:07,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:07,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:07" (1/1) ... [2019-10-22 11:22:07,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356138e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:07, skipping insertion in model container [2019-10-22 11:22:07,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:07" (1/1) ... [2019-10-22 11:22:07,833 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:07,868 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:08,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:08,230 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:08,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:08,326 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:08,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08 WrapperNode [2019-10-22 11:22:08,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:08,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:08,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:08,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:08,336 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:22:08" (1/1) ... [2019-10-22 11:22:08,352 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:22:08" (1/1) ... [2019-10-22 11:22:08,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:08,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:08,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:08,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:08,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (1/1) ... [2019-10-22 11:22:08,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:08,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:08,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:08,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:08,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/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:22:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:22:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:22:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:08,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:08,865 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:08,866 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-22 11:22:08,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:08 BoogieIcfgContainer [2019-10-22 11:22:08,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:08,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:08,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:08,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:08,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:07" (1/3) ... [2019-10-22 11:22:08,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb9ef8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:08, skipping insertion in model container [2019-10-22 11:22:08,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:08" (2/3) ... [2019-10-22 11:22:08,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb9ef8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:08, skipping insertion in model container [2019-10-22 11:22:08,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:08" (3/3) ... [2019-10-22 11:22:08,877 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-10-22 11:22:08,884 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:08,891 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-10-22 11:22:08,901 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-10-22 11:22:08,919 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:08,919 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:22:08,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:08,919 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:08,919 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:08,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:08,920 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:08,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-10-22 11:22:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:22:08,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:08,947 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:22:08,949 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:22:08,962 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:08,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868167796] [2019-10-22 11:22:08,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:08,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:08,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:09,102 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:22:09,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868167796] [2019-10-22 11:22:09,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:09,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:09,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276750851] [2019-10-22 11:22:09,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:09,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:09,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:09,127 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 3 states. [2019-10-22 11:22:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:09,252 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2019-10-22 11:22:09,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:09,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:22:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:09,264 INFO L225 Difference]: With dead ends: 101 [2019-10-22 11:22:09,265 INFO L226 Difference]: Without dead ends: 99 [2019-10-22 11:22:09,267 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:22:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-22 11:22:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2019-10-22 11:22:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:22:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-10-22 11:22:09,307 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 3 [2019-10-22 11:22:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:09,307 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-10-22 11:22:09,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-10-22 11:22:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:22:09,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:09,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:22:09,309 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:09,309 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 11:22:09,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:09,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811512511] [2019-10-22 11:22:09,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:09,354 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:22:09,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811512511] [2019-10-22 11:22:09,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:09,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:09,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065931265] [2019-10-22 11:22:09,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:09,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:09,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:09,356 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 3 states. [2019-10-22 11:22:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:09,456 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-10-22 11:22:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:09,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-10-22 11:22:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:09,457 INFO L225 Difference]: With dead ends: 97 [2019-10-22 11:22:09,457 INFO L226 Difference]: Without dead ends: 97 [2019-10-22 11:22:09,458 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:22:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-22 11:22:09,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2019-10-22 11:22:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:22:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-10-22 11:22:09,464 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 3 [2019-10-22 11:22:09,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:09,465 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-10-22 11:22:09,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-10-22 11:22:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:22:09,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:09,465 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:09,466 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash 59263649, now seen corresponding path program 1 times [2019-10-22 11:22:09,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:09,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984392462] [2019-10-22 11:22:09,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:09,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984392462] [2019-10-22 11:22:09,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:09,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:09,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752825676] [2019-10-22 11:22:09,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:09,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:09,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:09,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:09,507 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 4 states. [2019-10-22 11:22:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:09,644 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-10-22 11:22:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:09,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:22:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:09,646 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:22:09,646 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 11:22:09,646 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:22:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 11:22:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-10-22 11:22:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 11:22:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-10-22 11:22:09,651 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 8 [2019-10-22 11:22:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:09,651 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-10-22 11:22:09,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-10-22 11:22:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:22:09,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:09,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:09,652 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:09,653 INFO L82 PathProgramCache]: Analyzing trace with hash 59263650, now seen corresponding path program 1 times [2019-10-22 11:22:09,653 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:09,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85224353] [2019-10-22 11:22:09,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:09,707 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:22:09,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85224353] [2019-10-22 11:22:09,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:09,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:09,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493386748] [2019-10-22 11:22:09,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:09,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:09,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:09,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:09,709 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-10-22 11:22:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:09,838 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-10-22 11:22:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:09,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:22:09,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:09,839 INFO L225 Difference]: With dead ends: 93 [2019-10-22 11:22:09,839 INFO L226 Difference]: Without dead ends: 93 [2019-10-22 11:22:09,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-22 11:22:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-10-22 11:22:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 11:22:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2019-10-22 11:22:09,845 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 8 [2019-10-22 11:22:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:09,845 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2019-10-22 11:22:09,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2019-10-22 11:22:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:22:09,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:09,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:09,846 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:09,846 INFO L82 PathProgramCache]: Analyzing trace with hash 292159341, now seen corresponding path program 1 times [2019-10-22 11:22:09,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:09,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573251937] [2019-10-22 11:22:09,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:09,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:09,904 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:22:09,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573251937] [2019-10-22 11:22:09,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:09,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:09,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753273654] [2019-10-22 11:22:09,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:09,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:09,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:09,905 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 6 states. [2019-10-22 11:22:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:10,174 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2019-10-22 11:22:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:10,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 11:22:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:10,175 INFO L225 Difference]: With dead ends: 125 [2019-10-22 11:22:10,176 INFO L226 Difference]: Without dead ends: 125 [2019-10-22 11:22:10,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-22 11:22:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 78. [2019-10-22 11:22:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:22:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2019-10-22 11:22:10,182 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 11 [2019-10-22 11:22:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:10,182 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2019-10-22 11:22:10,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2019-10-22 11:22:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:22:10,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:10,183 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:10,184 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:10,184 INFO L82 PathProgramCache]: Analyzing trace with hash 292159342, now seen corresponding path program 1 times [2019-10-22 11:22:10,184 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:10,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498415712] [2019-10-22 11:22:10,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:10,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:10,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:10,269 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:22:10,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498415712] [2019-10-22 11:22:10,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:10,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:10,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614772694] [2019-10-22 11:22:10,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:10,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:10,271 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 6 states. [2019-10-22 11:22:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:10,619 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-10-22 11:22:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:10,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 11:22:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:10,621 INFO L225 Difference]: With dead ends: 123 [2019-10-22 11:22:10,621 INFO L226 Difference]: Without dead ends: 123 [2019-10-22 11:22:10,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:22:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-22 11:22:10,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 68. [2019-10-22 11:22:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 11:22:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-10-22 11:22:10,626 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 11 [2019-10-22 11:22:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:10,626 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-10-22 11:22:10,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-10-22 11:22:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:10,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:10,627 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:10,628 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1296424890, now seen corresponding path program 1 times [2019-10-22 11:22:10,628 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:10,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486769203] [2019-10-22 11:22:10,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:10,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:10,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:10,742 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:22:10,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486769203] [2019-10-22 11:22:10,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:10,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:10,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116123716] [2019-10-22 11:22:10,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:10,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:10,744 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 8 states. [2019-10-22 11:22:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:11,034 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2019-10-22 11:22:11,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:11,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-10-22 11:22:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:11,035 INFO L225 Difference]: With dead ends: 115 [2019-10-22 11:22:11,035 INFO L226 Difference]: Without dead ends: 115 [2019-10-22 11:22:11,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-22 11:22:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2019-10-22 11:22:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:22:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2019-10-22 11:22:11,041 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 13 [2019-10-22 11:22:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:11,041 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2019-10-22 11:22:11,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2019-10-22 11:22:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:22:11,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:11,042 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:11,042 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1296424891, now seen corresponding path program 1 times [2019-10-22 11:22:11,043 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:11,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369896314] [2019-10-22 11:22:11,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:11,191 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:22:11,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369896314] [2019-10-22 11:22:11,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:11,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:11,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650027441] [2019-10-22 11:22:11,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:11,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:11,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:11,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:11,193 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 8 states. [2019-10-22 11:22:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:11,565 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2019-10-22 11:22:11,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:11,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-10-22 11:22:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:11,566 INFO L225 Difference]: With dead ends: 146 [2019-10-22 11:22:11,566 INFO L226 Difference]: Without dead ends: 146 [2019-10-22 11:22:11,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-22 11:22:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 88. [2019-10-22 11:22:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:22:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2019-10-22 11:22:11,571 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 13 [2019-10-22 11:22:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:11,571 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2019-10-22 11:22:11,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2019-10-22 11:22:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:22:11,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:11,572 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:11,572 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:11,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1448044979, now seen corresponding path program 1 times [2019-10-22 11:22:11,573 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:11,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769600244] [2019-10-22 11:22:11,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:11,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:11,755 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:22:11,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769600244] [2019-10-22 11:22:11,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:11,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:11,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710525727] [2019-10-22 11:22:11,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:11,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:11,756 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 8 states. [2019-10-22 11:22:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:12,078 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2019-10-22 11:22:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:12,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-10-22 11:22:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:12,079 INFO L225 Difference]: With dead ends: 143 [2019-10-22 11:22:12,079 INFO L226 Difference]: Without dead ends: 143 [2019-10-22 11:22:12,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-22 11:22:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 88. [2019-10-22 11:22:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:22:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2019-10-22 11:22:12,084 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 16 [2019-10-22 11:22:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:12,084 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2019-10-22 11:22:12,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2019-10-22 11:22:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:22:12,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:12,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:12,085 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:12,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1448044978, now seen corresponding path program 1 times [2019-10-22 11:22:12,086 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:12,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525455545] [2019-10-22 11:22:12,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:12,185 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:22:12,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525455545] [2019-10-22 11:22:12,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:12,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:22:12,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855462866] [2019-10-22 11:22:12,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:22:12,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:22:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:12,187 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 9 states. [2019-10-22 11:22:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:12,530 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2019-10-22 11:22:12,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:22:12,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-10-22 11:22:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:12,531 INFO L225 Difference]: With dead ends: 131 [2019-10-22 11:22:12,531 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 11:22:12,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:22:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 11:22:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2019-10-22 11:22:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:22:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2019-10-22 11:22:12,535 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2019-10-22 11:22:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:12,536 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2019-10-22 11:22:12,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:22:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2019-10-22 11:22:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:22:12,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:12,536 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:12,537 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:12,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1939704561, now seen corresponding path program 1 times [2019-10-22 11:22:12,537 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:12,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482886804] [2019-10-22 11:22:12,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:12,652 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:22:12,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482886804] [2019-10-22 11:22:12,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:12,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:12,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689525712] [2019-10-22 11:22:12,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:12,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:12,653 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 8 states. [2019-10-22 11:22:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:12,957 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2019-10-22 11:22:12,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:12,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-22 11:22:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:12,958 INFO L225 Difference]: With dead ends: 143 [2019-10-22 11:22:12,958 INFO L226 Difference]: Without dead ends: 143 [2019-10-22 11:22:12,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-22 11:22:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2019-10-22 11:22:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:22:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2019-10-22 11:22:12,962 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 17 [2019-10-22 11:22:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:12,962 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2019-10-22 11:22:12,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2019-10-22 11:22:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:22:12,962 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:12,963 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:12,963 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:12,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:12,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1939704560, now seen corresponding path program 1 times [2019-10-22 11:22:12,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:12,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30179933] [2019-10-22 11:22:12,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:12,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:13,081 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:22:13,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30179933] [2019-10-22 11:22:13,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:13,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:13,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053413400] [2019-10-22 11:22:13,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:13,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:13,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:13,083 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand 8 states. [2019-10-22 11:22:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:13,294 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-10-22 11:22:13,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:13,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-22 11:22:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:13,295 INFO L225 Difference]: With dead ends: 126 [2019-10-22 11:22:13,295 INFO L226 Difference]: Without dead ends: 126 [2019-10-22 11:22:13,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-22 11:22:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2019-10-22 11:22:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:22:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-10-22 11:22:13,299 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 17 [2019-10-22 11:22:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:13,299 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-10-22 11:22:13,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-10-22 11:22:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:22:13,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:13,300 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:22:13,300 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:13,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1248679189, now seen corresponding path program 1 times [2019-10-22 11:22:13,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:13,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539089684] [2019-10-22 11:22:13,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:13,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:13,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:13,402 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:22:13,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539089684] [2019-10-22 11:22:13,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:13,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:22:13,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377447156] [2019-10-22 11:22:13,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:13,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:13,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:13,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:13,404 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 8 states. [2019-10-22 11:22:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:13,619 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2019-10-22 11:22:13,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:13,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-10-22 11:22:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:13,621 INFO L225 Difference]: With dead ends: 138 [2019-10-22 11:22:13,621 INFO L226 Difference]: Without dead ends: 138 [2019-10-22 11:22:13,622 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:22:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-22 11:22:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2019-10-22 11:22:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 11:22:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2019-10-22 11:22:13,627 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 20 [2019-10-22 11:22:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:13,627 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2019-10-22 11:22:13,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2019-10-22 11:22:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:22:13,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:13,628 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:22:13,629 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:13,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:13,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962907, now seen corresponding path program 1 times [2019-10-22 11:22:13,629 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:13,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677304464] [2019-10-22 11:22:13,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:13,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:13,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:13,661 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:22:13,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677304464] [2019-10-22 11:22:13,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:13,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:13,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965742148] [2019-10-22 11:22:13,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:13,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:13,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:13,663 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 5 states. [2019-10-22 11:22:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:13,764 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2019-10-22 11:22:13,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:13,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-22 11:22:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:13,765 INFO L225 Difference]: With dead ends: 113 [2019-10-22 11:22:13,765 INFO L226 Difference]: Without dead ends: 113 [2019-10-22 11:22:13,765 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:22:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-22 11:22:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-10-22 11:22:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:22:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 132 transitions. [2019-10-22 11:22:13,768 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 132 transitions. Word has length 21 [2019-10-22 11:22:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:13,769 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 132 transitions. [2019-10-22 11:22:13,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 132 transitions. [2019-10-22 11:22:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:22:13,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:13,770 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:22:13,770 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:13,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1536962906, now seen corresponding path program 1 times [2019-10-22 11:22:13,771 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:13,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398841477] [2019-10-22 11:22:13,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:13,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:13,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:13,952 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:22:13,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398841477] [2019-10-22 11:22:13,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:13,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:22:13,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85410137] [2019-10-22 11:22:13,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:22:13,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:22:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:13,954 INFO L87 Difference]: Start difference. First operand 110 states and 132 transitions. Second operand 9 states. [2019-10-22 11:22:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:14,306 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2019-10-22 11:22:14,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:14,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-10-22 11:22:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:14,307 INFO L225 Difference]: With dead ends: 138 [2019-10-22 11:22:14,307 INFO L226 Difference]: Without dead ends: 138 [2019-10-22 11:22:14,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:22:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-22 11:22:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 110. [2019-10-22 11:22:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 11:22:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2019-10-22 11:22:14,310 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 21 [2019-10-22 11:22:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:14,310 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2019-10-22 11:22:14,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:22:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2019-10-22 11:22:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:22:14,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:14,311 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:22:14,311 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:14,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1205114888, now seen corresponding path program 1 times [2019-10-22 11:22:14,312 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:14,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126488278] [2019-10-22 11:22:14,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:14,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:14,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:14,333 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:22:14,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126488278] [2019-10-22 11:22:14,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:14,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:14,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920434413] [2019-10-22 11:22:14,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:14,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:14,335 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 3 states. [2019-10-22 11:22:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:14,348 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2019-10-22 11:22:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:14,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 11:22:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:14,353 INFO L225 Difference]: With dead ends: 171 [2019-10-22 11:22:14,353 INFO L226 Difference]: Without dead ends: 171 [2019-10-22 11:22:14,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-22 11:22:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 122. [2019-10-22 11:22:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-22 11:22:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-10-22 11:22:14,361 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 21 [2019-10-22 11:22:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:14,361 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-10-22 11:22:14,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-10-22 11:22:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:22:14,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:14,362 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] [2019-10-22 11:22:14,362 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:14,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1684831896, now seen corresponding path program 1 times [2019-10-22 11:22:14,363 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:14,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910776693] [2019-10-22 11:22:14,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:14,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:14,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:14,534 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:22:14,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910776693] [2019-10-22 11:22:14,534 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:14,534 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:22:14,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249999343] [2019-10-22 11:22:14,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:22:14,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:22:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:22:14,535 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 9 states. [2019-10-22 11:22:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:14,806 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-10-22 11:22:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:22:14,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-22 11:22:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:14,807 INFO L225 Difference]: With dead ends: 136 [2019-10-22 11:22:14,807 INFO L226 Difference]: Without dead ends: 136 [2019-10-22 11:22:14,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:22:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-22 11:22:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2019-10-22 11:22:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-22 11:22:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2019-10-22 11:22:14,810 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 22 [2019-10-22 11:22:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:14,810 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2019-10-22 11:22:14,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:22:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2019-10-22 11:22:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:22:14,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:14,811 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:14,811 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash 404488326, now seen corresponding path program 1 times [2019-10-22 11:22:14,811 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:14,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315018556] [2019-10-22 11:22:14,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:14,812 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:14,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:14,851 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:22:14,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315018556] [2019-10-22 11:22:14,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:14,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:14,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666308874] [2019-10-22 11:22:14,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:14,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:14,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:14,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:14,852 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand 6 states. [2019-10-22 11:22:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:15,005 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2019-10-22 11:22:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:15,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-22 11:22:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:15,006 INFO L225 Difference]: With dead ends: 125 [2019-10-22 11:22:15,006 INFO L226 Difference]: Without dead ends: 125 [2019-10-22 11:22:15,007 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:22:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-22 11:22:15,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-22 11:22:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-22 11:22:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2019-10-22 11:22:15,010 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 23 [2019-10-22 11:22:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:15,010 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2019-10-22 11:22:15,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2019-10-22 11:22:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:22:15,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:15,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:15,011 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:15,011 INFO L82 PathProgramCache]: Analyzing trace with hash 404488327, now seen corresponding path program 1 times [2019-10-22 11:22:15,012 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:15,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594535269] [2019-10-22 11:22:15,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:15,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:15,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:15,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594535269] [2019-10-22 11:22:15,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474379228] [2019-10-22 11:22:15,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/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:22:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:15,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 11:22:15,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:15,323 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 23 treesize of output 15 [2019-10-22 11:22:15,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:15,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:15,331 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 28 treesize of output 16 [2019-10-22 11:22:15,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:15,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:15,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:15,335 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-10-22 11:22:15,368 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:22:15,368 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:15,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:15,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-10-22 11:22:15,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:15,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:15,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-10-22 11:22:15,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:15,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:15,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:15,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:22:15,425 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:41 [2019-10-22 11:22:15,451 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:22:15,451 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:22:15,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 14 [2019-10-22 11:22:15,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62737503] [2019-10-22 11:22:15,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:22:15,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:15,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:22:15,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:22:15,453 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand 7 states. [2019-10-22 11:22:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:15,633 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2019-10-22 11:22:15,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:15,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-22 11:22:15,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:15,634 INFO L225 Difference]: With dead ends: 123 [2019-10-22 11:22:15,634 INFO L226 Difference]: Without dead ends: 123 [2019-10-22 11:22:15,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-22 11:22:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-22 11:22:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-10-22 11:22:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-22 11:22:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2019-10-22 11:22:15,637 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 23 [2019-10-22 11:22:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:15,637 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2019-10-22 11:22:15,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:22:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2019-10-22 11:22:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:22:15,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:15,638 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:15,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:15,839 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1523443953, now seen corresponding path program 1 times [2019-10-22 11:22:15,839 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:15,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390861660] [2019-10-22 11:22:15,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:15,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:15,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:15,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390861660] [2019-10-22 11:22:15,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900857663] [2019-10-22 11:22:15,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:16,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 11:22:16,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:16,035 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:16,035 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:22:16,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,056 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-10-22 11:22:16,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-10-22 11:22:16,082 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:22:16,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:16,094 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:22:16,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-10-22 11:22:16,170 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:16,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 51 [2019-10-22 11:22:16,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,189 INFO L567 ElimStorePlain]: treesize reduction 24, result has 54.7 percent of original size [2019-10-22 11:22:16,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:29 [2019-10-22 11:22:16,229 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-22 11:22:16,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 11:22:16,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:16,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2019-10-22 11:22:16,275 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-22 11:22:16,275 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:22:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:16,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:16,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:16,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-22 11:22:16,294 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-10-22 11:22:16,295 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:22:16,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-10-22 11:22:16,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:16,342 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:22:16,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,355 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-10-22 11:22:16,355 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:22:16,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-10-22 11:22:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:16,411 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:16,418 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:22:16,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:16,421 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:22:16,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-10-22 11:22:16,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:16,466 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:22:16,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-10-22 11:22:18,823 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 778 treesize of output 762 [2019-10-22 11:22:18,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:18,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:18,872 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:22:19,177 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-10-22 11:22:19,177 INFO L567 ElimStorePlain]: treesize reduction 684, result has 10.2 percent of original size [2019-10-22 11:22:19,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:19,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:19,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:19,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:19,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:19,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:19,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-10-22 11:22:19,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:147 [2019-10-22 11:22:19,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:19,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1966284437] [2019-10-22 11:22:19,429 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 25 [2019-10-22 11:22:19,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:22:19,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:22:19,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:19,762 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:22:19,766 INFO L168 Benchmark]: Toolchain (without parser) took 11948.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -285.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,766 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:19,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 508.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.94 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,767 INFO L168 Benchmark]: Boogie Preprocessor took 29.17 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:22:19,768 INFO L168 Benchmark]: RCFGBuilder took 465.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,768 INFO L168 Benchmark]: TraceAbstraction took 10897.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -143.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:19,776 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 508.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.94 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 465.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10897.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -143.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:21,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:21,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:21,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:21,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:21,831 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:21,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:21,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:21,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:21,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:21,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:21,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:21,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:21,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:21,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:21,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:21,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:21,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:21,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:21,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:21,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:21,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:21,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:21,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:21,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:21,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:21,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:21,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:21,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:21,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:21,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:21,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:21,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:21,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:21,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:21,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:21,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:21,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:21,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:21,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:21,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:21,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-10-22 11:22:21,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:21,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:21,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:21,901 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:21,901 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:21,901 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:21,901 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:21,902 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:21,902 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:21,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:22:21,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:22:21,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:21,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:21,903 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:22:21,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:21,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:21,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:21,903 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:22:21,903 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:22:21,904 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:22:21,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:21,904 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:22:21,904 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:22:21,904 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:21,904 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:22:21,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:21,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:21,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:21,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:21,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:21,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:21,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:21,907 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:22:21,907 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:22:21,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:21,907 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_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/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 -> 811c06b4616c360d68e825b8fa9e0b4596e5faf8 [2019-10-22 11:22:21,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:21,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:21,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:21,954 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:21,954 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:21,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-10-22 11:22:21,999 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data/739883226/ef11b1dbe68b498f8a473d5deb5fc85f/FLAGa45bd2943 [2019-10-22 11:22:22,470 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:22,471 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-10-22 11:22:22,481 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data/739883226/ef11b1dbe68b498f8a473d5deb5fc85f/FLAGa45bd2943 [2019-10-22 11:22:22,495 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/bin/utaipan/data/739883226/ef11b1dbe68b498f8a473d5deb5fc85f [2019-10-22 11:22:22,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:22,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:22,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:22,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:22,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:22,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:22" (1/1) ... [2019-10-22 11:22:22,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28554e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:22, skipping insertion in model container [2019-10-22 11:22:22,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:22" (1/1) ... [2019-10-22 11:22:22,517 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:22,564 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:22,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:22,925 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:22,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:23,005 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:23,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23 WrapperNode [2019-10-22 11:22:23,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:23,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:23,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:23,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:23,015 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:22:23" (1/1) ... [2019-10-22 11:22:23,030 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:22:23" (1/1) ... [2019-10-22 11:22:23,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:23,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:23,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:23,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:23,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (1/1) ... [2019-10-22 11:22:23,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (1/1) ... [2019-10-22 11:22:23,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (1/1) ... [2019-10-22 11:22:23,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (1/1) ... [2019-10-22 11:22:23,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (1/1) ... [2019-10-22 11:22:23,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (1/1) ... [2019-10-22 11:22:23,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (1/1) ... [2019-10-22 11:22:23,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:23,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:23,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:23,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:23,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/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:22:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:22:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:23,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:22:23,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:23,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:23,674 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:23,675 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-10-22 11:22:23,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:23 BoogieIcfgContainer [2019-10-22 11:22:23,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:23,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:23,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:23,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:23,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:22" (1/3) ... [2019-10-22 11:22:23,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247eba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:23, skipping insertion in model container [2019-10-22 11:22:23,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:23" (2/3) ... [2019-10-22 11:22:23,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247eba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:23, skipping insertion in model container [2019-10-22 11:22:23,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:23" (3/3) ... [2019-10-22 11:22:23,687 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-10-22 11:22:23,698 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:23,706 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-10-22 11:22:23,717 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-10-22 11:22:23,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:23,737 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:22:23,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:23,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:23,737 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:23,737 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:23,737 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:23,737 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-10-22 11:22:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-10-22 11:22:23,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:23,766 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-10-22 11:22:23,768 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION]=== [2019-10-22 11:22:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-10-22 11:22:23,785 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:23,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1616177051] [2019-10-22 11:22:23,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa3e3fa-fb9b-4ee2-ab32-a2d453b40b10/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:22:24,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:24,032 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:22:24,036 INFO L168 Benchmark]: Toolchain (without parser) took 1536.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,037 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:24,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.47 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:22:24,039 INFO L168 Benchmark]: Boogie Preprocessor took 32.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:22:24,039 INFO L168 Benchmark]: RCFGBuilder took 592.25 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,040 INFO L168 Benchmark]: TraceAbstraction took 357.71 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: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:24,043 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 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 506.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.47 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. * Boogie Preprocessor took 32.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. * RCFGBuilder took 592.25 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 357.71 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: 12.0 MB). Peak memory consumption was 12.0 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...