./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-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_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/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 b651d63eb42259dfd3a213a6671e4c58ee528ad0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:34:58,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:34:58,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:34:58,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:34:58,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:34:58,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:34:58,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:34:58,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:34:58,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:34:58,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:34:58,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:34:58,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:34:58,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:34:58,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:34:58,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:34:58,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:34:58,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:34:58,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:34:58,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:34:58,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:34:58,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:34:58,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:34:58,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:34:58,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:34:58,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:34:58,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:34:58,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:34:58,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:34:58,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:34:58,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:34:58,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:34:58,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:34:58,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:34:58,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:34:58,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:34:58,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:34:58,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:34:58,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:34:58,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:34:58,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:34:58,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:34:58,260 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2019-12-07 13:34:58,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:34:58,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:34:58,271 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:34:58,271 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:34:58,271 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:34:58,271 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:34:58,271 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:34:58,271 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:34:58,271 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:34:58,271 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:34:58,272 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:34:58,272 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:34:58,272 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:34:58,272 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:34:58,272 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:34:58,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:34:58,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:34:58,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:34:58,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:34:58,273 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:34:58,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:34:58,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:34:58,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:34:58,274 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:34:58,274 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:34:58,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:34:58,274 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:34:58,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:34:58,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:34:58,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:34:58,274 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:34:58,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:34:58,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:34:58,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:34:58,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:34:58,275 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:34:58,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:34:58,275 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:34:58,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:34:58,275 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_f32147da-7a36-492b-ac99-93583a0b9012/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 -> b651d63eb42259dfd3a213a6671e4c58ee528ad0 [2019-12-07 13:34:58,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:34:58,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:34:58,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:34:58,386 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:34:58,387 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:34:58,387 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-12-07 13:34:58,425 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/data/18124277a/2c45ed829cac4b69b602880424793fd2/FLAG3352cbe46 [2019-12-07 13:34:58,828 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:34:58,828 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-12-07 13:34:58,836 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/data/18124277a/2c45ed829cac4b69b602880424793fd2/FLAG3352cbe46 [2019-12-07 13:34:58,845 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/data/18124277a/2c45ed829cac4b69b602880424793fd2 [2019-12-07 13:34:58,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:34:58,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:34:58,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:34:58,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:34:58,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:34:58,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:34:58" (1/1) ... [2019-12-07 13:34:58,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9050c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:58, skipping insertion in model container [2019-12-07 13:34:58,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:34:58" (1/1) ... [2019-12-07 13:34:58,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:34:58,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:34:59,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:34:59,087 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:34:59,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:34:59,145 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:34:59,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59 WrapperNode [2019-12-07 13:34:59,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:34:59,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:34:59,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:34:59,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:34:59,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:34:59,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:34:59,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:34:59,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:34:59,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... [2019-12-07 13:34:59,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:34:59,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:34:59,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:34:59,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:34:59,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/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 13:34:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:34:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:34:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:34:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:34:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:34:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:34:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:34:59,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:34:59,535 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:34:59,535 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 13:34:59,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:34:59 BoogieIcfgContainer [2019-12-07 13:34:59,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:34:59,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:34:59,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:34:59,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:34:59,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:34:58" (1/3) ... [2019-12-07 13:34:59,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452b95a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:34:59, skipping insertion in model container [2019-12-07 13:34:59,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:34:59" (2/3) ... [2019-12-07 13:34:59,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@452b95a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:34:59, skipping insertion in model container [2019-12-07 13:34:59,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:34:59" (3/3) ... [2019-12-07 13:34:59,541 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2019-12-07 13:34:59,547 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:34:59,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-12-07 13:34:59,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-12-07 13:34:59,571 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:34:59,571 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:34:59,572 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:34:59,572 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:34:59,572 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:34:59,572 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:34:59,572 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:34:59,572 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:34:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-12-07 13:34:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 13:34:59,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:59,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 13:34:59,590 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:34:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash 7010, now seen corresponding path program 1 times [2019-12-07 13:34:59,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:34:59,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486904903] [2019-12-07 13:34:59,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:59,691 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 13:34:59,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486904903] [2019-12-07 13:34:59,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:59,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:34:59,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236708443] [2019-12-07 13:34:59,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:34:59,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:34:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:34:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:59,706 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2019-12-07 13:34:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:59,781 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-12-07 13:34:59,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:34:59,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 13:34:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:59,790 INFO L225 Difference]: With dead ends: 96 [2019-12-07 13:34:59,791 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 13:34:59,792 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 13:34:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 13:34:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-12-07 13:34:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 13:34:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-12-07 13:34:59,822 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 2 [2019-12-07 13:34:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:59,822 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-12-07 13:34:59,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:34:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-12-07 13:34:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 13:34:59,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:59,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 13:34:59,823 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:34:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 7011, now seen corresponding path program 1 times [2019-12-07 13:34:59,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:34:59,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14101957] [2019-12-07 13:34:59,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:59,852 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 13:34:59,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14101957] [2019-12-07 13:34:59,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:59,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:34:59,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932713798] [2019-12-07 13:34:59,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:34:59,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:34:59,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:34:59,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:34:59,854 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 3 states. [2019-12-07 13:34:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:34:59,904 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2019-12-07 13:34:59,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:34:59,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 13:34:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:34:59,906 INFO L225 Difference]: With dead ends: 93 [2019-12-07 13:34:59,906 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 13:34:59,906 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 13:34:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 13:34:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-12-07 13:34:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 13:34:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-12-07 13:34:59,912 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 2 [2019-12-07 13:34:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:34:59,912 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-12-07 13:34:59,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:34:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-12-07 13:34:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:34:59,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:34:59,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:34:59,913 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:34:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:34:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2111003649, now seen corresponding path program 1 times [2019-12-07 13:34:59,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:34:59,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424407203] [2019-12-07 13:34:59,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:34:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:34:59,943 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 13:34:59,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424407203] [2019-12-07 13:34:59,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:34:59,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:34:59,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047611408] [2019-12-07 13:34:59,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:34:59,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:34:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:34:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:34:59,944 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 4 states. [2019-12-07 13:35:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:00,027 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-12-07 13:35:00,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:35:00,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 13:35:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:00,028 INFO L225 Difference]: With dead ends: 79 [2019-12-07 13:35:00,028 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 13:35:00,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 13:35:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 13:35:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-12-07 13:35:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 13:35:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-12-07 13:35:00,033 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 6 [2019-12-07 13:35:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:00,033 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-12-07 13:35:00,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:35:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-12-07 13:35:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:35:00,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:00,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:35:00,034 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2111003648, now seen corresponding path program 1 times [2019-12-07 13:35:00,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:00,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278555807] [2019-12-07 13:35:00,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:00,071 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 13:35:00,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278555807] [2019-12-07 13:35:00,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:00,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:35:00,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841061366] [2019-12-07 13:35:00,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:35:00,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:35:00,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:35:00,073 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 4 states. [2019-12-07 13:35:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:00,152 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-12-07 13:35:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:35:00,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 13:35:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:00,153 INFO L225 Difference]: With dead ends: 87 [2019-12-07 13:35:00,153 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 13:35:00,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 13:35:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 13:35:00,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-12-07 13:35:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 13:35:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-12-07 13:35:00,158 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 6 [2019-12-07 13:35:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:00,158 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-12-07 13:35:00,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:35:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-12-07 13:35:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 13:35:00,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:00,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:00,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:00,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:00,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1449927976, now seen corresponding path program 1 times [2019-12-07 13:35:00,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:00,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144058386] [2019-12-07 13:35:00,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:00,195 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 13:35:00,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144058386] [2019-12-07 13:35:00,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:00,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:35:00,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875829071] [2019-12-07 13:35:00,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:35:00,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:00,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:35:00,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:35:00,197 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-12-07 13:35:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:00,339 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2019-12-07 13:35:00,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:35:00,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 13:35:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:00,341 INFO L225 Difference]: With dead ends: 119 [2019-12-07 13:35:00,341 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 13:35:00,341 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 13:35:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 13:35:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2019-12-07 13:35:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 13:35:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-12-07 13:35:00,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 8 [2019-12-07 13:35:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:00,346 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-12-07 13:35:00,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:35:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-12-07 13:35:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 13:35:00,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:00,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:00,347 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:00,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1449927975, now seen corresponding path program 1 times [2019-12-07 13:35:00,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:00,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612133237] [2019-12-07 13:35:00,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:00,392 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 13:35:00,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612133237] [2019-12-07 13:35:00,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:00,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:35:00,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099173275] [2019-12-07 13:35:00,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:35:00,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:35:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:35:00,393 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 5 states. [2019-12-07 13:35:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:00,560 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2019-12-07 13:35:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:35:00,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 13:35:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:00,562 INFO L225 Difference]: With dead ends: 116 [2019-12-07 13:35:00,562 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 13:35:00,562 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 13:35:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 13:35:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 64. [2019-12-07 13:35:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 13:35:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-12-07 13:35:00,566 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2019-12-07 13:35:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:00,566 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-12-07 13:35:00,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:35:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-12-07 13:35:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:35:00,567 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:00,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:00,567 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:00,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1998397112, now seen corresponding path program 1 times [2019-12-07 13:35:00,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:00,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129121207] [2019-12-07 13:35:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:35:00,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129121207] [2019-12-07 13:35:00,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:00,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:35:00,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573170500] [2019-12-07 13:35:00,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:35:00,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:00,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:35:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:35:00,646 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 7 states. [2019-12-07 13:35:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:00,814 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2019-12-07 13:35:00,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:35:00,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 13:35:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:00,816 INFO L225 Difference]: With dead ends: 144 [2019-12-07 13:35:00,816 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 13:35:00,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:35:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 13:35:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 69. [2019-12-07 13:35:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 13:35:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-12-07 13:35:00,820 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 9 [2019-12-07 13:35:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:00,820 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-12-07 13:35:00,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:35:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-12-07 13:35:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:35:00,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:00,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:00,821 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1820764166, now seen corresponding path program 1 times [2019-12-07 13:35:00,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:00,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390391349] [2019-12-07 13:35:00,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:00,891 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 13:35:00,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390391349] [2019-12-07 13:35:00,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:00,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:35:00,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070212180] [2019-12-07 13:35:00,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:35:00,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:35:00,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:35:00,893 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 7 states. [2019-12-07 13:35:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:01,084 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2019-12-07 13:35:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:35:01,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 13:35:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:01,085 INFO L225 Difference]: With dead ends: 114 [2019-12-07 13:35:01,085 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 13:35:01,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:35:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 13:35:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2019-12-07 13:35:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 13:35:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2019-12-07 13:35:01,091 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 10 [2019-12-07 13:35:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:01,091 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2019-12-07 13:35:01,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:35:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2019-12-07 13:35:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:35:01,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:01,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:01,092 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1820764165, now seen corresponding path program 1 times [2019-12-07 13:35:01,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:01,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280096611] [2019-12-07 13:35:01,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:01,197 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 13:35:01,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280096611] [2019-12-07 13:35:01,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:01,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:35:01,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873128631] [2019-12-07 13:35:01,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:35:01,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:35:01,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:35:01,199 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand 7 states. [2019-12-07 13:35:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:01,404 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2019-12-07 13:35:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:35:01,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 13:35:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:01,406 INFO L225 Difference]: With dead ends: 138 [2019-12-07 13:35:01,406 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 13:35:01,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:35:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 13:35:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2019-12-07 13:35:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 13:35:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2019-12-07 13:35:01,409 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 10 [2019-12-07 13:35:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:01,409 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2019-12-07 13:35:01,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:35:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2019-12-07 13:35:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:35:01,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:01,410 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:01,410 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:01,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:01,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1110535348, now seen corresponding path program 1 times [2019-12-07 13:35:01,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:01,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893193596] [2019-12-07 13:35:01,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:01,438 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 13:35:01,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893193596] [2019-12-07 13:35:01,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:01,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:35:01,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270789388] [2019-12-07 13:35:01,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:35:01,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:01,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:35:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:35:01,440 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 5 states. [2019-12-07 13:35:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:01,520 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2019-12-07 13:35:01,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:35:01,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 13:35:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:01,521 INFO L225 Difference]: With dead ends: 128 [2019-12-07 13:35:01,521 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 13:35:01,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 13:35:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 13:35:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2019-12-07 13:35:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 13:35:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-12-07 13:35:01,523 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 12 [2019-12-07 13:35:01,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:01,524 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-12-07 13:35:01,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:35:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2019-12-07 13:35:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:35:01,524 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:01,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:01,524 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:01,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1243211530, now seen corresponding path program 1 times [2019-12-07 13:35:01,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:01,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387777119] [2019-12-07 13:35:01,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:01,620 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 13:35:01,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387777119] [2019-12-07 13:35:01,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:01,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:35:01,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901746684] [2019-12-07 13:35:01,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:35:01,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:01,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:35:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:35:01,622 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 8 states. [2019-12-07 13:35:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:01,864 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-12-07 13:35:01,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:35:01,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-12-07 13:35:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:01,865 INFO L225 Difference]: With dead ends: 127 [2019-12-07 13:35:01,865 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 13:35:01,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:35:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 13:35:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2019-12-07 13:35:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 13:35:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2019-12-07 13:35:01,868 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 13 [2019-12-07 13:35:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:01,868 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2019-12-07 13:35:01,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:35:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2019-12-07 13:35:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:35:01,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:01,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:01,869 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:01,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1243211529, now seen corresponding path program 1 times [2019-12-07 13:35:01,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:01,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680808442] [2019-12-07 13:35:01,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:01,960 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 13:35:01,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680808442] [2019-12-07 13:35:01,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:01,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:35:01,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109451391] [2019-12-07 13:35:01,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:35:01,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:01,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:35:01,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:35:01,961 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand 7 states. [2019-12-07 13:35:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:02,178 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2019-12-07 13:35:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:35:02,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-07 13:35:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:02,179 INFO L225 Difference]: With dead ends: 130 [2019-12-07 13:35:02,179 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 13:35:02,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:35:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 13:35:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 96. [2019-12-07 13:35:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 13:35:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2019-12-07 13:35:02,181 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 13 [2019-12-07 13:35:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:02,181 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2019-12-07 13:35:02,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:35:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2019-12-07 13:35:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:35:02,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:02,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:02,182 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1224224443, now seen corresponding path program 1 times [2019-12-07 13:35:02,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:02,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343845033] [2019-12-07 13:35:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:02,196 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 13:35:02,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343845033] [2019-12-07 13:35:02,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:02,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:35:02,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853266703] [2019-12-07 13:35:02,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:35:02,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:35:02,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:35:02,198 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand 3 states. [2019-12-07 13:35:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:02,210 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2019-12-07 13:35:02,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:35:02,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 13:35:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:02,212 INFO L225 Difference]: With dead ends: 154 [2019-12-07 13:35:02,212 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 13:35:02,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:35:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 13:35:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 106. [2019-12-07 13:35:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 13:35:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2019-12-07 13:35:02,216 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 15 [2019-12-07 13:35:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:02,216 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2019-12-07 13:35:02,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:35:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2019-12-07 13:35:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:35:02,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:02,217 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:02,217 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:02,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -986980676, now seen corresponding path program 1 times [2019-12-07 13:35:02,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:02,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519318194] [2019-12-07 13:35:02,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:02,287 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 13:35:02,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519318194] [2019-12-07 13:35:02,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:02,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:35:02,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532967030] [2019-12-07 13:35:02,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:35:02,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:35:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:35:02,289 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand 7 states. [2019-12-07 13:35:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:02,463 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2019-12-07 13:35:02,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:35:02,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 13:35:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:02,465 INFO L225 Difference]: With dead ends: 140 [2019-12-07 13:35:02,465 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 13:35:02,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:35:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 13:35:02,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-12-07 13:35:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 13:35:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 135 transitions. [2019-12-07 13:35:02,469 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 135 transitions. Word has length 16 [2019-12-07 13:35:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:02,469 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 135 transitions. [2019-12-07 13:35:02,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:35:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 135 transitions. [2019-12-07 13:35:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:35:02,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:02,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:02,471 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1009063173, now seen corresponding path program 1 times [2019-12-07 13:35:02,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:02,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921051432] [2019-12-07 13:35:02,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:02,650 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 13:35:02,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921051432] [2019-12-07 13:35:02,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:02,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:35:02,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928847215] [2019-12-07 13:35:02,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:35:02,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:02,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:35:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:35:02,652 INFO L87 Difference]: Start difference. First operand 107 states and 135 transitions. Second operand 10 states. [2019-12-07 13:35:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:02,998 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-12-07 13:35:02,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:35:02,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-12-07 13:35:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:02,999 INFO L225 Difference]: With dead ends: 136 [2019-12-07 13:35:03,003 INFO L226 Difference]: Without dead ends: 136 [2019-12-07 13:35:03,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:35:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-07 13:35:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2019-12-07 13:35:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 13:35:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2019-12-07 13:35:03,006 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 16 [2019-12-07 13:35:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:03,006 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2019-12-07 13:35:03,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:35:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2019-12-07 13:35:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:35:03,007 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:03,007 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 13:35:03,007 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash -531554097, now seen corresponding path program 1 times [2019-12-07 13:35:03,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:03,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105024336] [2019-12-07 13:35:03,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:03,069 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 13:35:03,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105024336] [2019-12-07 13:35:03,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:03,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:35:03,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096496122] [2019-12-07 13:35:03,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:35:03,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:03,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:35:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:35:03,070 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand 8 states. [2019-12-07 13:35:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:03,251 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2019-12-07 13:35:03,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:35:03,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 13:35:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:03,253 INFO L225 Difference]: With dead ends: 151 [2019-12-07 13:35:03,253 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 13:35:03,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:35:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 13:35:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 115. [2019-12-07 13:35:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 13:35:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 145 transitions. [2019-12-07 13:35:03,257 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 145 transitions. Word has length 17 [2019-12-07 13:35:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:03,257 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 145 transitions. [2019-12-07 13:35:03,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:35:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 145 transitions. [2019-12-07 13:35:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:35:03,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:03,258 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 13:35:03,259 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:03,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1216559473, now seen corresponding path program 1 times [2019-12-07 13:35:03,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:03,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972504507] [2019-12-07 13:35:03,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:03,294 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 13:35:03,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972504507] [2019-12-07 13:35:03,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:03,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:35:03,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540616255] [2019-12-07 13:35:03,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:35:03,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:03,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:35:03,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:35:03,295 INFO L87 Difference]: Start difference. First operand 115 states and 145 transitions. Second operand 5 states. [2019-12-07 13:35:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:03,372 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2019-12-07 13:35:03,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:35:03,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 13:35:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:03,373 INFO L225 Difference]: With dead ends: 115 [2019-12-07 13:35:03,373 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 13:35:03,373 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 13:35:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 13:35:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-12-07 13:35:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 13:35:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 142 transitions. [2019-12-07 13:35:03,375 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 142 transitions. Word has length 17 [2019-12-07 13:35:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:03,375 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 142 transitions. [2019-12-07 13:35:03,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:35:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2019-12-07 13:35:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:35:03,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:03,376 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 13:35:03,376 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1216559472, now seen corresponding path program 1 times [2019-12-07 13:35:03,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:03,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5908700] [2019-12-07 13:35:03,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:03,458 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 13:35:03,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5908700] [2019-12-07 13:35:03,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:03,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:35:03,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523916939] [2019-12-07 13:35:03,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:35:03,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:03,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:35:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:35:03,459 INFO L87 Difference]: Start difference. First operand 114 states and 142 transitions. Second operand 9 states. [2019-12-07 13:35:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:03,745 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2019-12-07 13:35:03,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:35:03,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-12-07 13:35:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:03,746 INFO L225 Difference]: With dead ends: 131 [2019-12-07 13:35:03,746 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 13:35:03,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:35:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 13:35:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2019-12-07 13:35:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 13:35:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2019-12-07 13:35:03,748 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 17 [2019-12-07 13:35:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:03,749 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2019-12-07 13:35:03,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:35:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2019-12-07 13:35:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:35:03,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:03,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:03,749 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:03,750 INFO L82 PathProgramCache]: Analyzing trace with hash 699349823, now seen corresponding path program 1 times [2019-12-07 13:35:03,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:03,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127221096] [2019-12-07 13:35:03,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:35:03,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127221096] [2019-12-07 13:35:03,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:35:03,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:35:03,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560639705] [2019-12-07 13:35:03,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:35:03,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:35:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:35:03,869 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand 8 states. [2019-12-07 13:35:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:04,005 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2019-12-07 13:35:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:35:04,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 13:35:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:04,006 INFO L225 Difference]: With dead ends: 111 [2019-12-07 13:35:04,006 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 13:35:04,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:35:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 13:35:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2019-12-07 13:35:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 13:35:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2019-12-07 13:35:04,008 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 18 [2019-12-07 13:35:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:04,008 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2019-12-07 13:35:04,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:35:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2019-12-07 13:35:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:35:04,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:04,009 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:04,009 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:04,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:04,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1099608688, now seen corresponding path program 1 times [2019-12-07 13:35:04,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:04,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666401410] [2019-12-07 13:35:04,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:35:04,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666401410] [2019-12-07 13:35:04,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399385608] [2019-12-07 13:35:04,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/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 13:35:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:35:04,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 13:35:04,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:35:04,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 13:35:04,179 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,184 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-12-07 13:35:04,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 13:35:04,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,211 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 13:35:04,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-12-07 13:35:04,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2019-12-07 13:35:04,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,267 INFO L614 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-12-07 13:35:04,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,267 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2019-12-07 13:35:04,291 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 13:35:04,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-12-07 13:35:04,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,298 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-12-07 13:35:04,330 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-12-07 13:35:04,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-12-07 13:35:04,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:04,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,342 INFO L614 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-12-07 13:35:04,342 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:35:04,342 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-12-07 13:35:04,369 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-12-07 13:35:04,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-12-07 13:35:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:35:04,375 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:35:04,386 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:35:04,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,388 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:35:04,388 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-12-07 13:35:04,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:04,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:04,415 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:35:04,415 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-12-07 13:35:06,527 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 746 treesize of output 730 [2019-12-07 13:35:06,529 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:35:06,697 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2019-12-07 13:35:06,697 INFO L614 ElimStorePlain]: treesize reduction 660, result has 6.5 percent of original size [2019-12-07 13:35:06,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:06,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:06,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:35:06,700 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 13:35:06,700 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:15 [2019-12-07 13:35:06,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:35:06,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 13:35:06,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:35:06,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:35:06,774 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:35:06,774 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:1 [2019-12-07 13:35:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:35:06,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [165420003] [2019-12-07 13:35:06,791 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 13:35:06,792 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:35:06,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:35:06,799 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:35:06,800 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:35:07,068 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:35:07,078 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:35:07,509 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:35:07,854 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:35:07,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:35:07,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2019-12-07 13:35:07,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297717971] [2019-12-07 13:35:07,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 13:35:07,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:35:07,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 13:35:07,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=769, Unknown=1, NotChecked=0, Total=870 [2019-12-07 13:35:07,855 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand 20 states. [2019-12-07 13:35:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:35:08,670 INFO L93 Difference]: Finished difference Result 192 states and 220 transitions. [2019-12-07 13:35:08,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:35:08,671 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2019-12-07 13:35:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:35:08,672 INFO L225 Difference]: With dead ends: 192 [2019-12-07 13:35:08,672 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 13:35:08,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=209, Invalid=1272, Unknown=1, NotChecked=0, Total=1482 [2019-12-07 13:35:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 13:35:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 117. [2019-12-07 13:35:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-12-07 13:35:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2019-12-07 13:35:08,678 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 18 [2019-12-07 13:35:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:35:08,678 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-12-07 13:35:08,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 13:35:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2019-12-07 13:35:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:35:08,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:35:08,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:35:08,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:35:08,881 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 13:35:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:35:08,881 INFO L82 PathProgramCache]: Analyzing trace with hash -882474535, now seen corresponding path program 1 times [2019-12-07 13:35:08,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:35:08,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327067704] [2019-12-07 13:35:08,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:35:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:35:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:35:08,913 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:35:08,913 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:35:08,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:35:08 BoogieIcfgContainer [2019-12-07 13:35:08,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:35:08,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:35:08,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:35:08,934 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:35:08,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:34:59" (3/4) ... [2019-12-07 13:35:08,935 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:35:08,964 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f32147da-7a36-492b-ac99-93583a0b9012/bin/utaipan/witness.graphml [2019-12-07 13:35:08,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:35:08,965 INFO L168 Benchmark]: Toolchain (without parser) took 10117.66 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.7 MB). Free memory was 934.5 MB in the beginning and 1.0 GB in the end (delta: -77.0 MB). Peak memory consumption was 250.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:08,965 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:35:08,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:08,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:35:08,966 INFO L168 Benchmark]: Boogie Preprocessor took 21.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:35:08,966 INFO L168 Benchmark]: RCFGBuilder took 337.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:08,966 INFO L168 Benchmark]: TraceAbstraction took 9396.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.0 MB). Peak memory consumption was 231.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:08,966 INFO L168 Benchmark]: Witness Printer took 30.99 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:35:08,968 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 337.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9396.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.0 MB). Peak memory consumption was 231.9 MB. Max. memory is 11.5 GB. * Witness Printer took 30.99 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1021]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = head [L987] head->data = 0 [L989] SLL* x = head; [L990] int state = 1; [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x->data = state [L1016] EXPR head->next [L1016] x = head->next [L1017] COND FALSE !(!(((void*)0) != x)) [L1019] EXPR x->data [L1019] COND TRUE x->data != 0 [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data [L1021] EXPR x->data [L1021] EXPR x->next [L1021] EXPR x->next->data [L1021] EXPR x->next->data != 0 && x->data > x->next->data [L1021] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1021] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 46 error locations. Result: UNSAFE, OverallTime: 9.3s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1060 SDtfs, 2869 SDslu, 2539 SDs, 0 SdLazy, 3554 SolverSat, 398 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 44 SyntacticMatches, 11 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=20, 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, 20 MinimizatonAttempts, 627 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 247 ConstructedInterpolants, 12 QuantifiedInterpolants, 40879 SizeOfPredicates, 11 NumberOfNonLiveVariables, 110 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...