./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adee0aad8018029b1a093d0ddfc0de44abfd0e03 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:33:19,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:33:19,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:33:19,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:33:19,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:33:19,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:33:19,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:33:19,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:33:19,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:33:19,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:33:19,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:33:19,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:33:19,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:33:19,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:33:19,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:33:19,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:33:19,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:33:19,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:33:19,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:33:19,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:33:19,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:33:19,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:33:19,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:33:19,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:33:19,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:33:19,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:33:19,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:33:19,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:33:19,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:33:19,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:33:19,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:33:19,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:33:19,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:33:19,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:33:19,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:33:19,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:33:19,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:33:19,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:33:19,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:33:19,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:33:19,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:33:19,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2019-12-07 16:33:19,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:33:19,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:33:19,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:33:19,314 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:33:19,314 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:33:19,314 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:33:19,314 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:33:19,314 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:33:19,314 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:33:19,314 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:33:19,315 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:33:19,315 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:33:19,315 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:33:19,315 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:33:19,315 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:33:19,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:33:19,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:33:19,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:33:19,316 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:33:19,316 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 16:33:19,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:33:19,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:33:19,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:33:19,316 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 16:33:19,317 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 16:33:19,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:33:19,317 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:33:19,317 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:33:19,317 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:33:19,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:33:19,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:33:19,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:33:19,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:33:19,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:33:19,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:33:19,318 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:33:19,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:33:19,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:33:19,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:33:19,318 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/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/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-memcleanup) ) 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 -> adee0aad8018029b1a093d0ddfc0de44abfd0e03 [2019-12-07 16:33:19,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:33:19,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:33:19,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:33:19,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:33:19,430 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:33:19,431 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-12-07 16:33:19,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/data/9c95aa1c5/b92fe25e8bd14bb2ba215810142df9df/FLAG61b48a877 [2019-12-07 16:33:19,910 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:33:19,910 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-12-07 16:33:19,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/data/9c95aa1c5/b92fe25e8bd14bb2ba215810142df9df/FLAG61b48a877 [2019-12-07 16:33:19,929 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/data/9c95aa1c5/b92fe25e8bd14bb2ba215810142df9df [2019-12-07 16:33:19,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:33:19,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:33:19,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:33:19,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:33:19,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:33:19,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:33:19" (1/1) ... [2019-12-07 16:33:19,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591cea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:19, skipping insertion in model container [2019-12-07 16:33:19,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:33:19" (1/1) ... [2019-12-07 16:33:19,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:33:19,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:33:20,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:33:20,184 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:33:20,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:33:20,241 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:33:20,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20 WrapperNode [2019-12-07 16:33:20,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:33:20,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:33:20,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:33:20,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:33:20,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:33:20,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:33:20,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:33:20,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:33:20,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... [2019-12-07 16:33:20,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:33:20,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:33:20,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:33:20,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:33:20,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/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-12-07 16:33:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 16:33:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:33:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:33:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:33:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:33:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:33:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:33:20,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:33:20,673 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:33:20,674 INFO L287 CfgBuilder]: Removed 12 assume(true) statements. [2019-12-07 16:33:20,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:33:20 BoogieIcfgContainer [2019-12-07 16:33:20,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:33:20,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:33:20,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:33:20,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:33:20,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:33:19" (1/3) ... [2019-12-07 16:33:20,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c31bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:33:20, skipping insertion in model container [2019-12-07 16:33:20,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:33:20" (2/3) ... [2019-12-07 16:33:20,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c31bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:33:20, skipping insertion in model container [2019-12-07 16:33:20,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:33:20" (3/3) ... [2019-12-07 16:33:20,679 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-2.i [2019-12-07 16:33:20,686 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:33:20,690 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-12-07 16:33:20,698 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-12-07 16:33:20,709 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:33:20,710 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 16:33:20,710 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:33:20,710 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:33:20,710 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:33:20,710 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:33:20,710 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:33:20,710 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:33:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-12-07 16:33:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 16:33:20,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:20,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 16:33:20,726 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:20,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:20,730 INFO L82 PathProgramCache]: Analyzing trace with hash 6948, now seen corresponding path program 1 times [2019-12-07 16:33:20,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:20,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101407370] [2019-12-07 16:33:20,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:20,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101407370] [2019-12-07 16:33:20,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:20,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:33:20,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138498891] [2019-12-07 16:33:20,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:33:20,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:20,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:33:20,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:33:20,842 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2019-12-07 16:33:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:20,943 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-12-07 16:33:20,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:33:20,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 16:33:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:20,951 INFO L225 Difference]: With dead ends: 91 [2019-12-07 16:33:20,951 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 16:33:20,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 16:33:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 16:33:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-12-07 16:33:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 16:33:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2019-12-07 16:33:20,977 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 2 [2019-12-07 16:33:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:20,977 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2019-12-07 16:33:20,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:33:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2019-12-07 16:33:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 16:33:20,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:20,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 16:33:20,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:20,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash 6949, now seen corresponding path program 1 times [2019-12-07 16:33:20,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:20,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964362999] [2019-12-07 16:33:20,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:21,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964362999] [2019-12-07 16:33:21,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:21,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:33:21,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623800002] [2019-12-07 16:33:21,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:33:21,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:21,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:33:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:33:21,003 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 3 states. [2019-12-07 16:33:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:21,087 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-12-07 16:33:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:33:21,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 16:33:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:21,089 INFO L225 Difference]: With dead ends: 108 [2019-12-07 16:33:21,089 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 16:33:21,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 16:33:21,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 16:33:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2019-12-07 16:33:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:33:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-12-07 16:33:21,098 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 2 [2019-12-07 16:33:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:21,098 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-12-07 16:33:21,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:33:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-12-07 16:33:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:33:21,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:21,099 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:33:21,099 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2126586191, now seen corresponding path program 1 times [2019-12-07 16:33:21,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:21,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777097591] [2019-12-07 16:33:21,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:21,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777097591] [2019-12-07 16:33:21,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:21,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:33:21,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874955215] [2019-12-07 16:33:21,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:33:21,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:21,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:33:21,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:33:21,153 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 4 states. [2019-12-07 16:33:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:21,256 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-12-07 16:33:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:33:21,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 16:33:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:21,257 INFO L225 Difference]: With dead ends: 85 [2019-12-07 16:33:21,258 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 16:33:21,258 INFO L630 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-12-07 16:33:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 16:33:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2019-12-07 16:33:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 16:33:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-12-07 16:33:21,263 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 6 [2019-12-07 16:33:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:21,263 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-12-07 16:33:21,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:33:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-12-07 16:33:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:33:21,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:21,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:33:21,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:21,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2126586192, now seen corresponding path program 1 times [2019-12-07 16:33:21,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:21,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625427301] [2019-12-07 16:33:21,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:21,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625427301] [2019-12-07 16:33:21,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:21,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:33:21,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667518463] [2019-12-07 16:33:21,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:33:21,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:21,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:33:21,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:33:21,318 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 5 states. [2019-12-07 16:33:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:21,496 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2019-12-07 16:33:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:33:21,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-12-07 16:33:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:21,497 INFO L225 Difference]: With dead ends: 102 [2019-12-07 16:33:21,497 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 16:33:21,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:33:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 16:33:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2019-12-07 16:33:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 16:33:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2019-12-07 16:33:21,502 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 6 [2019-12-07 16:33:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:21,502 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-12-07 16:33:21,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:33:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2019-12-07 16:33:21,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:33:21,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:21,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:21,503 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash -755098140, now seen corresponding path program 1 times [2019-12-07 16:33:21,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:21,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042855576] [2019-12-07 16:33:21,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:21,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042855576] [2019-12-07 16:33:21,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:21,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:33:21,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453569684] [2019-12-07 16:33:21,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:33:21,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:21,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:33:21,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:33:21,539 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 5 states. [2019-12-07 16:33:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:21,715 INFO L93 Difference]: Finished difference Result 154 states and 178 transitions. [2019-12-07 16:33:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:33:21,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 16:33:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:21,717 INFO L225 Difference]: With dead ends: 154 [2019-12-07 16:33:21,717 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 16:33:21,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-07 16:33:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 16:33:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 90. [2019-12-07 16:33:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 16:33:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2019-12-07 16:33:21,722 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 8 [2019-12-07 16:33:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:21,723 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2019-12-07 16:33:21,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:33:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2019-12-07 16:33:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 16:33:21,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:21,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:21,724 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash -755098139, now seen corresponding path program 1 times [2019-12-07 16:33:21,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:21,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416836742] [2019-12-07 16:33:21,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:21,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416836742] [2019-12-07 16:33:21,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:21,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:33:21,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068905771] [2019-12-07 16:33:21,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:33:21,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:21,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:33:21,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:33:21,769 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand 5 states. [2019-12-07 16:33:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:21,972 INFO L93 Difference]: Finished difference Result 161 states and 187 transitions. [2019-12-07 16:33:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:33:21,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 16:33:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:21,973 INFO L225 Difference]: With dead ends: 161 [2019-12-07 16:33:21,973 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 16:33:21,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:33:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 16:33:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 82. [2019-12-07 16:33:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 16:33:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2019-12-07 16:33:21,978 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 8 [2019-12-07 16:33:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:21,978 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2019-12-07 16:33:21,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:33:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2019-12-07 16:33:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 16:33:21,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:21,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:21,979 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1230738947, now seen corresponding path program 1 times [2019-12-07 16:33:21,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:21,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613638491] [2019-12-07 16:33:21,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:22,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613638491] [2019-12-07 16:33:22,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:22,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:33:22,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95856396] [2019-12-07 16:33:22,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:33:22,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:22,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:33:22,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:33:22,017 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand 5 states. [2019-12-07 16:33:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:22,115 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2019-12-07 16:33:22,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:33:22,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 16:33:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:22,116 INFO L225 Difference]: With dead ends: 92 [2019-12-07 16:33:22,116 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 16:33:22,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-12-07 16:33:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 16:33:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-12-07 16:33:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 16:33:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-12-07 16:33:22,120 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 12 [2019-12-07 16:33:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:22,120 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-12-07 16:33:22,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:33:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-12-07 16:33:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:33:22,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:22,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:22,121 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash -499819679, now seen corresponding path program 1 times [2019-12-07 16:33:22,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:22,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978139029] [2019-12-07 16:33:22,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:22,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978139029] [2019-12-07 16:33:22,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:22,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:33:22,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097993635] [2019-12-07 16:33:22,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:33:22,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:33:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:33:22,149 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 5 states. [2019-12-07 16:33:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:22,254 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2019-12-07 16:33:22,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:33:22,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 16:33:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:22,255 INFO L225 Difference]: With dead ends: 117 [2019-12-07 16:33:22,256 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 16:33:22,256 INFO L630 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-12-07 16:33:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 16:33:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 87. [2019-12-07 16:33:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 16:33:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-12-07 16:33:22,259 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 13 [2019-12-07 16:33:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:22,259 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-12-07 16:33:22,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:33:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-12-07 16:33:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:33:22,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:22,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:22,260 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -499819678, now seen corresponding path program 1 times [2019-12-07 16:33:22,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:22,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676884133] [2019-12-07 16:33:22,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:22,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676884133] [2019-12-07 16:33:22,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:22,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:33:22,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514191845] [2019-12-07 16:33:22,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:33:22,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:22,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:33:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:33:22,302 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 5 states. [2019-12-07 16:33:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:22,426 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2019-12-07 16:33:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:33:22,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 16:33:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:22,427 INFO L225 Difference]: With dead ends: 125 [2019-12-07 16:33:22,427 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 16:33:22,428 INFO L630 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-12-07 16:33:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 16:33:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2019-12-07 16:33:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 16:33:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-12-07 16:33:22,430 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 13 [2019-12-07 16:33:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:22,431 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-12-07 16:33:22,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:33:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-12-07 16:33:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:33:22,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:22,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:22,431 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash -90690302, now seen corresponding path program 1 times [2019-12-07 16:33:22,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:22,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951563221] [2019-12-07 16:33:22,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:22,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951563221] [2019-12-07 16:33:22,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290188185] [2019-12-07 16:33:22,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/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-12-07 16:33:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:22,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 16:33:22,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:33:22,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:22,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 16:33:22,559 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:22,568 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 16:33:22,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:22,569 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-12-07 16:33:22,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 16:33:22,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:22,588 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:22,588 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:33:22,589 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-12-07 16:33:22,609 INFO L377 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 17 treesize of output 9 [2019-12-07 16:33:22,610 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:33:22,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:33:22,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:33:22,616 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2019-12-07 16:33:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:22,628 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:33:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:22,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [534849026] [2019-12-07 16:33:22,663 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 16:33:22,664 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:33:22,667 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:33:22,671 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:33:22,671 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:33:22,911 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:33:23,729 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-12-07 16:33:23,946 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2019-12-07 16:33:23,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:33:23,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 6, 6] total 20 [2019-12-07 16:33:23,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121883703] [2019-12-07 16:33:23,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:33:23,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:33:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:33:23,997 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 11 states. [2019-12-07 16:33:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:24,379 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2019-12-07 16:33:24,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:33:24,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-07 16:33:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:24,383 INFO L225 Difference]: With dead ends: 93 [2019-12-07 16:33:24,383 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 16:33:24,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:33:24,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 16:33:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-12-07 16:33:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 16:33:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-12-07 16:33:24,392 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 14 [2019-12-07 16:33:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:24,393 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-12-07 16:33:24,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:33:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-12-07 16:33:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:33:24,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:24,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:24,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:33:24,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:24,597 INFO L82 PathProgramCache]: Analyzing trace with hash 709731248, now seen corresponding path program 1 times [2019-12-07 16:33:24,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:24,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784859697] [2019-12-07 16:33:24,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:24,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784859697] [2019-12-07 16:33:24,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:24,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:33:24,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98015333] [2019-12-07 16:33:24,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:33:24,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:24,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:33:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:33:24,666 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 9 states. [2019-12-07 16:33:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:24,884 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-12-07 16:33:24,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:33:24,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 16:33:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:24,885 INFO L225 Difference]: With dead ends: 94 [2019-12-07 16:33:24,885 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 16:33:24,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:33:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 16:33:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2019-12-07 16:33:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 16:33:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2019-12-07 16:33:24,888 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 15 [2019-12-07 16:33:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:24,888 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-12-07 16:33:24,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:33:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2019-12-07 16:33:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:33:24,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:24,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:24,889 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash 709731249, now seen corresponding path program 1 times [2019-12-07 16:33:24,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:24,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897202734] [2019-12-07 16:33:24,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:24,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897202734] [2019-12-07 16:33:24,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:24,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:33:24,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721969706] [2019-12-07 16:33:24,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:33:24,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:24,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:33:24,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:33:24,966 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand 9 states. [2019-12-07 16:33:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:25,228 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2019-12-07 16:33:25,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:33:25,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 16:33:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:25,230 INFO L225 Difference]: With dead ends: 93 [2019-12-07 16:33:25,230 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 16:33:25,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:33:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 16:33:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2019-12-07 16:33:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 16:33:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-12-07 16:33:25,235 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 15 [2019-12-07 16:33:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:25,235 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-12-07 16:33:25,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:33:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-12-07 16:33:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:33:25,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:25,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:25,237 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1483505443, now seen corresponding path program 1 times [2019-12-07 16:33:25,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:25,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643820029] [2019-12-07 16:33:25,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:25,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643820029] [2019-12-07 16:33:25,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:25,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:33:25,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099707788] [2019-12-07 16:33:25,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:33:25,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:25,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:33:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:33:25,291 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 7 states. [2019-12-07 16:33:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:25,457 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2019-12-07 16:33:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:33:25,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 16:33:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:25,458 INFO L225 Difference]: With dead ends: 125 [2019-12-07 16:33:25,458 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 16:33:25,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:33:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 16:33:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2019-12-07 16:33:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 16:33:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2019-12-07 16:33:25,462 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 15 [2019-12-07 16:33:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:25,462 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2019-12-07 16:33:25,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:33:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2019-12-07 16:33:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:33:25,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:25,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:25,463 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:25,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:25,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1483505444, now seen corresponding path program 1 times [2019-12-07 16:33:25,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:25,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933352287] [2019-12-07 16:33:25,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:25,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933352287] [2019-12-07 16:33:25,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:25,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:33:25,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068580491] [2019-12-07 16:33:25,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:33:25,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:25,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:33:25,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:33:25,516 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand 6 states. [2019-12-07 16:33:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:25,718 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2019-12-07 16:33:25,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:33:25,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 16:33:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:25,719 INFO L225 Difference]: With dead ends: 144 [2019-12-07 16:33:25,719 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 16:33:25,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:33:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 16:33:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2019-12-07 16:33:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 16:33:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2019-12-07 16:33:25,722 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 15 [2019-12-07 16:33:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:25,723 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-12-07 16:33:25,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:33:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2019-12-07 16:33:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:33:25,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:25,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:25,724 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:25,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1255895945, now seen corresponding path program 1 times [2019-12-07 16:33:25,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:25,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581355044] [2019-12-07 16:33:25,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:33:25,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581355044] [2019-12-07 16:33:25,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:25,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:33:25,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49948912] [2019-12-07 16:33:25,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:33:25,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:33:25,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:33:25,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:33:25,757 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand 6 states. [2019-12-07 16:33:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:25,897 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2019-12-07 16:33:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:33:25,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 16:33:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:25,898 INFO L225 Difference]: With dead ends: 137 [2019-12-07 16:33:25,898 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 16:33:25,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:33:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 16:33:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2019-12-07 16:33:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 16:33:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2019-12-07 16:33:25,900 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 16 [2019-12-07 16:33:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:25,900 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2019-12-07 16:33:25,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:33:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2019-12-07 16:33:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:33:25,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:25,901 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:25,901 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 16:33:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash -280408248, now seen corresponding path program 1 times [2019-12-07 16:33:25,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:33:25,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778155579] [2019-12-07 16:33:25,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:33:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:33:25,928 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:33:25,928 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:33:25,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:33:25 BoogieIcfgContainer [2019-12-07 16:33:25,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:33:25,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:33:25,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:33:25,948 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:33:25,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:33:20" (3/4) ... [2019-12-07 16:33:25,950 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:33:25,979 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6144d032-30db-4eca-b067-12a6bba3b411/bin/utaipan/witness.graphml [2019-12-07 16:33:25,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:33:25,981 INFO L168 Benchmark]: Toolchain (without parser) took 6049.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.4 MB in the beginning and 924.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:33:25,981 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:33:25,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:33:25,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:33:25,982 INFO L168 Benchmark]: Boogie Preprocessor took 21.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:33:25,982 INFO L168 Benchmark]: RCFGBuilder took 379.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:33:25,982 INFO L168 Benchmark]: TraceAbstraction took 5272.21 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.0 GB in the beginning and 926.1 MB in the end (delta: 98.4 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:33:25,982 INFO L168 Benchmark]: Witness Printer took 32.16 ms. Allocated memory is still 1.2 GB. Free memory was 926.1 MB in the beginning and 924.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:33:25,984 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 379.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5272.21 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.0 GB in the beginning and 926.1 MB in the end (delta: 98.4 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. * Witness Printer took 32.16 ms. Allocated memory is still 1.2 GB. Free memory was 926.1 MB in the beginning and 924.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1042]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L988] SLL* head = malloc(sizeof(SLL)); [L989] head->next = ((void*)0) [L990] head->data = 0 [L992] SLL* x = head; [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND TRUE __VERIFIER_nondet_int() [L1006] x = malloc(sizeof(SLL)) [L1007] x->data = 1 [L1008] x->next = head [L1009] head = x [L1029] x = head [L1032] EXPR x->data [L1032] COND FALSE !(x->data != 1) [L1038] EXPR x->next [L1038] x = x->next [L1039] COND TRUE \read(*x) [L1041] EXPR x->data [L1041] COND TRUE x->data != 1 [L1042] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 49 error locations. Result: UNSAFE, OverallTime: 5.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 716 SDtfs, 1289 SDslu, 925 SDs, 0 SdLazy, 2646 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 355 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 14187 SizeOfPredicates, 8 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 248, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 12, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 16, TOOLS_POST_TIME[ms]: 198, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 16, TOOLS_QUANTIFIERELIM_TIME[ms]: 193, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 55, FLUID_QUERY_TIME[ms]: 2, FLUID_QUERIES: 34, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME[ms]: 0, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 12, DOMAIN_ISBOTTOM_TIME[ms]: 18, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 4, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 3, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 1, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 7, DAG_COMPRESSION_PROCESSED_NODES: 117, DAG_COMPRESSION_RETAINED_NODES: 36, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...