./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 811c06b4616c360d68e825b8fa9e0b4596e5faf8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 811c06b4616c360d68e825b8fa9e0b4596e5faf8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:44:21,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:44:21,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:44:21,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:44:21,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:44:21,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:44:21,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:44:21,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:44:21,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:44:21,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:44:21,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:44:21,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:44:21,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:44:21,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:44:21,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:44:21,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:44:21,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:44:21,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:44:21,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:44:21,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:44:21,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:44:21,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:44:21,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:44:21,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:44:21,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:44:21,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:44:21,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:44:21,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:44:21,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:44:21,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:44:21,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:44:21,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:44:21,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:44:21,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:44:21,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:44:21,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:44:21,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:44:21,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:44:21,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:44:21,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:44:21,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:44:21,312 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 13:44:21,326 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:44:21,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:44:21,327 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:44:21,327 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:44:21,327 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:44:21,327 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:44:21,328 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:44:21,328 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:44:21,328 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:44:21,328 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:44:21,328 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:44:21,328 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:44:21,329 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:44:21,329 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:44:21,329 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:44:21,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:44:21,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:44:21,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:44:21,330 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:44:21,330 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:44:21,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:44:21,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:44:21,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:44:21,331 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:44:21,331 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:44:21,331 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:44:21,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:44:21,332 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:44:21,332 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:44:21,332 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:44:21,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:44:21,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:44:21,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:44:21,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:44:21,333 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:44:21,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:44:21,333 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:44:21,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:44:21,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:44:21,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:44:21,334 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_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 811c06b4616c360d68e825b8fa9e0b4596e5faf8 [2019-12-07 13:44:21,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:44:21,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:44:21,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:44:21,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:44:21,457 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:44:21,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-12-07 13:44:21,495 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data/b43edf0ae/1a3f0f401add45539016daf30ea564c3/FLAGf92e6f750 [2019-12-07 13:44:21,951 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:44:21,951 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-12-07 13:44:21,960 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data/b43edf0ae/1a3f0f401add45539016daf30ea564c3/FLAGf92e6f750 [2019-12-07 13:44:21,968 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data/b43edf0ae/1a3f0f401add45539016daf30ea564c3 [2019-12-07 13:44:21,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:44:21,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:44:21,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:44:21,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:44:21,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:44:21,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:44:21" (1/1) ... [2019-12-07 13:44:21,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27569ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:21, skipping insertion in model container [2019-12-07 13:44:21,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:44:21" (1/1) ... [2019-12-07 13:44:21,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:44:22,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:44:22,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:44:22,245 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:44:22,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:44:22,306 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:44:22,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22 WrapperNode [2019-12-07 13:44:22,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:44:22,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:44:22,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:44:22,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:44:22,312 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:44:22" (1/1) ... [2019-12-07 13:44:22,322 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:44:22" (1/1) ... [2019-12-07 13:44:22,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:44:22,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:44:22,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:44:22,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:44:22,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (1/1) ... [2019-12-07 13:44:22,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (1/1) ... [2019-12-07 13:44:22,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (1/1) ... [2019-12-07 13:44:22,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (1/1) ... [2019-12-07 13:44:22,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (1/1) ... [2019-12-07 13:44:22,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (1/1) ... [2019-12-07 13:44:22,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (1/1) ... [2019-12-07 13:44:22,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:44:22,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:44:22,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:44:22,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:44:22,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/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:44:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:44:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:44:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:44:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:44:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:44:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:44:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:44:22,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:44:22,702 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:44:22,702 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 13:44:22,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:22 BoogieIcfgContainer [2019-12-07 13:44:22,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:44:22,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:44:22,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:44:22,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:44:22,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:44:21" (1/3) ... [2019-12-07 13:44:22,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72027bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:44:22, skipping insertion in model container [2019-12-07 13:44:22,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:22" (2/3) ... [2019-12-07 13:44:22,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72027bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:44:22, skipping insertion in model container [2019-12-07 13:44:22,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:22" (3/3) ... [2019-12-07 13:44:22,708 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-12-07 13:44:22,714 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:44:22,719 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-12-07 13:44:22,727 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-12-07 13:44:22,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:44:22,739 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:44:22,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:44:22,739 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:44:22,739 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:44:22,739 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:44:22,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:44:22,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:44:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2019-12-07 13:44:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 13:44:22,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:22,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 13:44:22,757 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:44:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash 7010, now seen corresponding path program 1 times [2019-12-07 13:44:22,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:22,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843576570] [2019-12-07 13:44:22,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:22,857 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:44:22,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843576570] [2019-12-07 13:44:22,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:22,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:44:22,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729929882] [2019-12-07 13:44:22,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:22,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:22,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:22,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:22,873 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2019-12-07 13:44:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:22,950 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-12-07 13:44:22,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:22,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 13:44:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:22,961 INFO L225 Difference]: With dead ends: 96 [2019-12-07 13:44:22,961 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 13:44:22,963 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:44:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 13:44:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2019-12-07 13:44:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 13:44:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-12-07 13:44:22,995 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 2 [2019-12-07 13:44:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:22,995 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-12-07 13:44:22,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-12-07 13:44:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 13:44:22,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:22,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 13:44:22,996 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:44:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash 7011, now seen corresponding path program 1 times [2019-12-07 13:44:22,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:22,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499477535] [2019-12-07 13:44:22,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:23,019 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:44:23,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499477535] [2019-12-07 13:44:23,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:23,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:44:23,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130696995] [2019-12-07 13:44:23,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:23,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:23,021 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 3 states. [2019-12-07 13:44:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:23,069 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2019-12-07 13:44:23,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:23,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 13:44:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:23,070 INFO L225 Difference]: With dead ends: 93 [2019-12-07 13:44:23,070 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 13:44:23,071 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:44:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 13:44:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-12-07 13:44:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 13:44:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2019-12-07 13:44:23,076 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 2 [2019-12-07 13:44:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:23,077 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2019-12-07 13:44:23,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2019-12-07 13:44:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:44:23,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:23,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:44:23,077 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:44:23,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2111003649, now seen corresponding path program 1 times [2019-12-07 13:44:23,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:23,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687613079] [2019-12-07 13:44:23,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:23,111 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:44:23,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687613079] [2019-12-07 13:44:23,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:23,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:23,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747460159] [2019-12-07 13:44:23,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:23,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:23,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:23,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:23,112 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 4 states. [2019-12-07 13:44:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:23,203 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2019-12-07 13:44:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:23,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 13:44:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:23,204 INFO L225 Difference]: With dead ends: 79 [2019-12-07 13:44:23,204 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 13:44:23,204 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:44:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 13:44:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-12-07 13:44:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 13:44:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2019-12-07 13:44:23,209 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 6 [2019-12-07 13:44:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:23,209 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2019-12-07 13:44:23,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2019-12-07 13:44:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:44:23,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:23,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 13:44:23,209 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:44:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:23,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2111003648, now seen corresponding path program 1 times [2019-12-07 13:44:23,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:23,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143293818] [2019-12-07 13:44:23,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:23,254 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:44:23,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143293818] [2019-12-07 13:44:23,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:23,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:23,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609974585] [2019-12-07 13:44:23,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:23,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:23,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:23,256 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 4 states. [2019-12-07 13:44:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:23,331 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-12-07 13:44:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:23,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 13:44:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:23,332 INFO L225 Difference]: With dead ends: 87 [2019-12-07 13:44:23,332 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 13:44:23,333 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:44:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 13:44:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2019-12-07 13:44:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 13:44:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-12-07 13:44:23,337 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 6 [2019-12-07 13:44:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:23,337 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-12-07 13:44:23,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-12-07 13:44:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 13:44:23,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:23,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:23,338 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:44:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:23,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1449927976, now seen corresponding path program 1 times [2019-12-07 13:44:23,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:23,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172778991] [2019-12-07 13:44:23,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:23,374 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:44:23,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172778991] [2019-12-07 13:44:23,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:23,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:23,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869050480] [2019-12-07 13:44:23,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:23,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:23,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:23,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:23,375 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-12-07 13:44:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:23,525 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2019-12-07 13:44:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:44:23,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 13:44:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:23,527 INFO L225 Difference]: With dead ends: 119 [2019-12-07 13:44:23,527 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 13:44:23,527 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:44:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 13:44:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2019-12-07 13:44:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 13:44:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-12-07 13:44:23,531 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 8 [2019-12-07 13:44:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:23,532 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-12-07 13:44:23,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-12-07 13:44:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 13:44:23,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:23,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:23,533 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:44:23,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1449927975, now seen corresponding path program 1 times [2019-12-07 13:44:23,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:23,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798939020] [2019-12-07 13:44:23,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:23,576 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:44:23,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798939020] [2019-12-07 13:44:23,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:23,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:23,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126417579] [2019-12-07 13:44:23,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:23,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:23,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:23,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:23,578 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 5 states. [2019-12-07 13:44:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:23,749 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2019-12-07 13:44:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:44:23,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 13:44:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:23,750 INFO L225 Difference]: With dead ends: 116 [2019-12-07 13:44:23,751 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 13:44:23,751 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:44:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 13:44:23,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 64. [2019-12-07 13:44:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 13:44:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-12-07 13:44:23,755 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2019-12-07 13:44:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:23,755 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-12-07 13:44:23,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-12-07 13:44:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:44:23,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:23,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:23,757 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:44:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1998397112, now seen corresponding path program 1 times [2019-12-07 13:44:23,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:23,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390863423] [2019-12-07 13:44:23,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:23,839 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:44:23,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390863423] [2019-12-07 13:44:23,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:23,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:44:23,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364748532] [2019-12-07 13:44:23,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:44:23,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:23,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:44:23,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:23,841 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 7 states. [2019-12-07 13:44:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:23,996 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2019-12-07 13:44:23,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:44:23,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 13:44:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:23,997 INFO L225 Difference]: With dead ends: 144 [2019-12-07 13:44:23,998 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 13:44:23,998 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:44:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 13:44:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 69. [2019-12-07 13:44:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 13:44:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2019-12-07 13:44:24,002 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 9 [2019-12-07 13:44:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:24,002 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2019-12-07 13:44:24,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:44:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2019-12-07 13:44:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:44:24,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:24,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:24,003 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:44:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:24,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1820764166, now seen corresponding path program 1 times [2019-12-07 13:44:24,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:24,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334626383] [2019-12-07 13:44:24,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:24,074 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:44:24,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334626383] [2019-12-07 13:44:24,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:24,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:44:24,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425090196] [2019-12-07 13:44:24,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:44:24,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:24,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:44:24,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:24,075 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 7 states. [2019-12-07 13:44:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:24,270 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2019-12-07 13:44:24,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:44:24,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 13:44:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:24,271 INFO L225 Difference]: With dead ends: 114 [2019-12-07 13:44:24,271 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 13:44:24,271 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:44:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 13:44:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2019-12-07 13:44:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 13:44:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2019-12-07 13:44:24,275 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 10 [2019-12-07 13:44:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:24,275 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2019-12-07 13:44:24,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:44:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2019-12-07 13:44:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:44:24,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:24,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:24,276 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:44:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1820764165, now seen corresponding path program 1 times [2019-12-07 13:44:24,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:24,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083621614] [2019-12-07 13:44:24,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:24,365 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:44:24,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083621614] [2019-12-07 13:44:24,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:24,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:44:24,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981239115] [2019-12-07 13:44:24,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:44:24,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:44:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:24,367 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand 7 states. [2019-12-07 13:44:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:24,575 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2019-12-07 13:44:24,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:44:24,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 13:44:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:24,576 INFO L225 Difference]: With dead ends: 138 [2019-12-07 13:44:24,576 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 13:44:24,576 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:44:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 13:44:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2019-12-07 13:44:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 13:44:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2019-12-07 13:44:24,579 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 10 [2019-12-07 13:44:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:24,580 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2019-12-07 13:44:24,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:44:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2019-12-07 13:44:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:44:24,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:24,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:24,580 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:44:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1110535348, now seen corresponding path program 1 times [2019-12-07 13:44:24,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:24,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591107608] [2019-12-07 13:44:24,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:24,604 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:44:24,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591107608] [2019-12-07 13:44:24,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:24,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:44:24,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766902910] [2019-12-07 13:44:24,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:24,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:24,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:24,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:24,605 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 5 states. [2019-12-07 13:44:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:24,694 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2019-12-07 13:44:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:44:24,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 13:44:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:24,695 INFO L225 Difference]: With dead ends: 128 [2019-12-07 13:44:24,695 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 13:44:24,695 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:44:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 13:44:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2019-12-07 13:44:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 13:44:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-12-07 13:44:24,698 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 12 [2019-12-07 13:44:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:24,698 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-12-07 13:44:24,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2019-12-07 13:44:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:44:24,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:24,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:24,699 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:44:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1243211530, now seen corresponding path program 1 times [2019-12-07 13:44:24,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:24,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199120251] [2019-12-07 13:44:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:24,790 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:44:24,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199120251] [2019-12-07 13:44:24,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:24,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:44:24,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119424158] [2019-12-07 13:44:24,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:44:24,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:24,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:44:24,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:24,792 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 8 states. [2019-12-07 13:44:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:25,046 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2019-12-07 13:44:25,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:44:25,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-12-07 13:44:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:25,047 INFO L225 Difference]: With dead ends: 127 [2019-12-07 13:44:25,047 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 13:44:25,047 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:44:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 13:44:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2019-12-07 13:44:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 13:44:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2019-12-07 13:44:25,050 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 13 [2019-12-07 13:44:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:25,050 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2019-12-07 13:44:25,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:44:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2019-12-07 13:44:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:44:25,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:25,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:25,050 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:44:25,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:25,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1243211529, now seen corresponding path program 1 times [2019-12-07 13:44:25,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:25,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818991931] [2019-12-07 13:44:25,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:25,142 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:44:25,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818991931] [2019-12-07 13:44:25,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:25,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:44:25,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370764771] [2019-12-07 13:44:25,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:44:25,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:25,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:44:25,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:25,143 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand 7 states. [2019-12-07 13:44:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:25,370 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2019-12-07 13:44:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:44:25,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-07 13:44:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:25,371 INFO L225 Difference]: With dead ends: 130 [2019-12-07 13:44:25,371 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 13:44:25,371 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:44:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 13:44:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 96. [2019-12-07 13:44:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-07 13:44:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2019-12-07 13:44:25,373 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 13 [2019-12-07 13:44:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:25,374 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2019-12-07 13:44:25,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:44:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2019-12-07 13:44:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:44:25,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:25,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:25,374 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:44:25,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:25,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1224224443, now seen corresponding path program 1 times [2019-12-07 13:44:25,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:25,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557997667] [2019-12-07 13:44:25,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:25,389 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:44:25,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557997667] [2019-12-07 13:44:25,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:25,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:25,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44355674] [2019-12-07 13:44:25,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:25,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:25,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:25,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:25,390 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand 3 states. [2019-12-07 13:44:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:25,403 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2019-12-07 13:44:25,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:25,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 13:44:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:25,406 INFO L225 Difference]: With dead ends: 154 [2019-12-07 13:44:25,406 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 13:44:25,406 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:44:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 13:44:25,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 106. [2019-12-07 13:44:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 13:44:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2019-12-07 13:44:25,410 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 15 [2019-12-07 13:44:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:25,411 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2019-12-07 13:44:25,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2019-12-07 13:44:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:44:25,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:25,412 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:44:25,412 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:44:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash -986980676, now seen corresponding path program 1 times [2019-12-07 13:44:25,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:25,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314444846] [2019-12-07 13:44:25,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:25,486 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:44:25,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314444846] [2019-12-07 13:44:25,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:25,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:44:25,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761730544] [2019-12-07 13:44:25,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:44:25,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:44:25,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:25,488 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand 7 states. [2019-12-07 13:44:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:25,614 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2019-12-07 13:44:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:44:25,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 13:44:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:25,615 INFO L225 Difference]: With dead ends: 140 [2019-12-07 13:44:25,615 INFO L226 Difference]: Without dead ends: 140 [2019-12-07 13:44:25,615 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:44:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-07 13:44:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-12-07 13:44:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 13:44:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 135 transitions. [2019-12-07 13:44:25,617 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 135 transitions. Word has length 16 [2019-12-07 13:44:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:25,617 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 135 transitions. [2019-12-07 13:44:25,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:44:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 135 transitions. [2019-12-07 13:44:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:44:25,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:25,618 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:44:25,618 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:44:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1009074705, now seen corresponding path program 1 times [2019-12-07 13:44:25,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:25,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347642121] [2019-12-07 13:44:25,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:25,630 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:44:25,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347642121] [2019-12-07 13:44:25,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:25,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:25,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991271426] [2019-12-07 13:44:25,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:25,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:25,631 INFO L87 Difference]: Start difference. First operand 107 states and 135 transitions. Second operand 3 states. [2019-12-07 13:44:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:25,638 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2019-12-07 13:44:25,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:25,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:44:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:25,639 INFO L225 Difference]: With dead ends: 110 [2019-12-07 13:44:25,639 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 13:44:25,640 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:44:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 13:44:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-12-07 13:44:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 13:44:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 138 transitions. [2019-12-07 13:44:25,643 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 138 transitions. Word has length 16 [2019-12-07 13:44:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:25,643 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 138 transitions. [2019-12-07 13:44:25,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 138 transitions. [2019-12-07 13:44:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:44:25,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:25,644 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:44:25,644 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:44:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash -531554097, now seen corresponding path program 1 times [2019-12-07 13:44:25,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:25,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117330127] [2019-12-07 13:44:25,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:25,725 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:44:25,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117330127] [2019-12-07 13:44:25,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:25,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:44:25,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557871770] [2019-12-07 13:44:25,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:44:25,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:44:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:25,726 INFO L87 Difference]: Start difference. First operand 110 states and 138 transitions. Second operand 8 states. [2019-12-07 13:44:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:25,890 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-12-07 13:44:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:44:25,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-07 13:44:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:25,891 INFO L225 Difference]: With dead ends: 145 [2019-12-07 13:44:25,891 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 13:44:25,891 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:44:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 13:44:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 111. [2019-12-07 13:44:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 13:44:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2019-12-07 13:44:25,894 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 17 [2019-12-07 13:44:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:25,894 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2019-12-07 13:44:25,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:44:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2019-12-07 13:44:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:44:25,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:25,895 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:44:25,895 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:44:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:25,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1216497905, now seen corresponding path program 1 times [2019-12-07 13:44:25,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:25,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754570411] [2019-12-07 13:44:25,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:44:25,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754570411] [2019-12-07 13:44:25,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:25,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:25,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005877789] [2019-12-07 13:44:25,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:25,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:25,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:25,918 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand 5 states. [2019-12-07 13:44:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:25,999 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2019-12-07 13:44:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:44:25,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 13:44:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:26,000 INFO L225 Difference]: With dead ends: 110 [2019-12-07 13:44:26,000 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 13:44:26,000 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:44:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 13:44:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-12-07 13:44:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 13:44:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2019-12-07 13:44:26,003 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 17 [2019-12-07 13:44:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:26,003 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2019-12-07 13:44:26,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2019-12-07 13:44:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:44:26,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:26,004 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:44:26,004 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:44:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1216497904, now seen corresponding path program 1 times [2019-12-07 13:44:26,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:26,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738577843] [2019-12-07 13:44:26,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:44:26,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738577843] [2019-12-07 13:44:26,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:26,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:44:26,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671202758] [2019-12-07 13:44:26,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:44:26,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:44:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:44:26,103 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand 9 states. [2019-12-07 13:44:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:26,378 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2019-12-07 13:44:26,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:44:26,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-12-07 13:44:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:26,379 INFO L225 Difference]: With dead ends: 128 [2019-12-07 13:44:26,379 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 13:44:26,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:44:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 13:44:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2019-12-07 13:44:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 13:44:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2019-12-07 13:44:26,383 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 17 [2019-12-07 13:44:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:26,383 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2019-12-07 13:44:26,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:44:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2019-12-07 13:44:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:44:26,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:26,384 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:44:26,385 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:44:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash 699349823, now seen corresponding path program 1 times [2019-12-07 13:44:26,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:26,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556524199] [2019-12-07 13:44:26,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:26,511 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:44:26,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556524199] [2019-12-07 13:44:26,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:26,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:44:26,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998262364] [2019-12-07 13:44:26,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:44:26,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:26,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:44:26,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:26,513 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand 8 states. [2019-12-07 13:44:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:26,665 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2019-12-07 13:44:26,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:44:26,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 13:44:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:26,666 INFO L225 Difference]: With dead ends: 114 [2019-12-07 13:44:26,666 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 13:44:26,667 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:44:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 13:44:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2019-12-07 13:44:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 13:44:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2019-12-07 13:44:26,668 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 18 [2019-12-07 13:44:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:26,669 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2019-12-07 13:44:26,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:44:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2019-12-07 13:44:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:44:26,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:26,669 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:44:26,669 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:44:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:26,670 INFO L82 PathProgramCache]: Analyzing trace with hash 941949459, now seen corresponding path program 1 times [2019-12-07 13:44:26,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:26,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561213416] [2019-12-07 13:44:26,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:44:26,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561213416] [2019-12-07 13:44:26,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:26,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:26,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991031724] [2019-12-07 13:44:26,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:26,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:26,691 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 5 states. [2019-12-07 13:44:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:26,767 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2019-12-07 13:44:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:44:26,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 13:44:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:26,768 INFO L225 Difference]: With dead ends: 104 [2019-12-07 13:44:26,768 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 13:44:26,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 13:44:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-12-07 13:44:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 13:44:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2019-12-07 13:44:26,770 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 18 [2019-12-07 13:44:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:26,770 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2019-12-07 13:44:26,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2019-12-07 13:44:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:44:26,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:26,770 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:44:26,770 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:44:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash 941949460, now seen corresponding path program 1 times [2019-12-07 13:44:26,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:26,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789106367] [2019-12-07 13:44:26,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:44:26,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789106367] [2019-12-07 13:44:26,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794003426] [2019-12-07 13:44:26,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/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:44:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:26,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:44:26,895 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:26,957 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 23 treesize of output 15 [2019-12-07 13:44:26,957 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:26,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:26,964 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 28 treesize of output 16 [2019-12-07 13:44:26,964 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:26,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:26,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:26,968 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-12-07 13:44:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:44:26,979 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:26,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:26,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 13:44:26,992 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:26,999 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:26,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-12-07 13:44:27,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:27,002 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 13:44:27,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,013 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 13:44:27,013 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:41 [2019-12-07 13:44:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:44:27,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:44:27,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 12 [2019-12-07 13:44:27,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091966589] [2019-12-07 13:44:27,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:44:27,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:44:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:44:27,042 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand 6 states. [2019-12-07 13:44:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:27,171 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-12-07 13:44:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:44:27,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-12-07 13:44:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:27,172 INFO L225 Difference]: With dead ends: 103 [2019-12-07 13:44:27,172 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 13:44:27,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:44:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 13:44:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-12-07 13:44:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 13:44:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2019-12-07 13:44:27,175 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 18 [2019-12-07 13:44:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:27,175 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2019-12-07 13:44:27,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:44:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2019-12-07 13:44:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:44:27,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:27,176 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:44:27,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:44:27,377 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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:44:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1099608688, now seen corresponding path program 1 times [2019-12-07 13:44:27,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:27,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925590454] [2019-12-07 13:44:27,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:27,491 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:44:27,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925590454] [2019-12-07 13:44:27,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712925460] [2019-12-07 13:44:27,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:44:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:27,527 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 13:44:27,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:27,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,539 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:44:27,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,543 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-12-07 13:44:27,561 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:44:27,561 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,567 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,567 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:44:27,567 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-12-07 13:44:27,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,605 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:44:27,606 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,619 INFO L614 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-12-07 13:44:27,619 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,619 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2019-12-07 13:44:27,644 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 13:44:27,645 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:44:27,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,650 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-12-07 13:44:27,684 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-12-07 13:44:27,684 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:44:27,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:44:27,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:27,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:27,687 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 13:44:27,700 INFO L614 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-12-07 13:44:27,700 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:44:27,700 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-12-07 13:44:27,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,728 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:44:27,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,731 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:44:27,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-12-07 13:44:27,733 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:44:27,733 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:27,737 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:44:27,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,740 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:44:27,740 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-12-07 13:44:27,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:27,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:27,766 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:44:27,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-12-07 13:44:29,855 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:44:29,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:44:30,021 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2019-12-07 13:44:30,022 INFO L614 ElimStorePlain]: treesize reduction 660, result has 6.5 percent of original size [2019-12-07 13:44:30,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:30,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:30,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:30,024 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:44:30,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:15 [2019-12-07 13:44:30,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:44:30,097 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:44:30,098 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:30,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:30,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:30,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:1 [2019-12-07 13:44:30,100 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:44:30,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1386699758] [2019-12-07 13:44:30,115 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 13:44:30,115 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:44:30,119 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:44:30,123 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:44:30,123 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:44:30,366 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:44:30,370 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:44:30,792 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:44:31,308 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:44:31,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:44:31,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2019-12-07 13:44:31,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829899793] [2019-12-07 13:44:31,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 13:44:31,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 13:44:31,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=769, Unknown=1, NotChecked=0, Total=870 [2019-12-07 13:44:31,311 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand 20 states. [2019-12-07 13:44:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:32,664 INFO L93 Difference]: Finished difference Result 193 states and 220 transitions. [2019-12-07 13:44:32,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:44:32,664 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2019-12-07 13:44:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:32,665 INFO L225 Difference]: With dead ends: 193 [2019-12-07 13:44:32,665 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 13:44:32,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=195, Invalid=1210, Unknown=1, NotChecked=0, Total=1406 [2019-12-07 13:44:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 13:44:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 120. [2019-12-07 13:44:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 13:44:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2019-12-07 13:44:32,670 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 18 [2019-12-07 13:44:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:32,670 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2019-12-07 13:44:32,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 13:44:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2019-12-07 13:44:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:44:32,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:32,671 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:44:32,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:44:32,872 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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:44:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:32,873 INFO L82 PathProgramCache]: Analyzing trace with hash -823308648, now seen corresponding path program 1 times [2019-12-07 13:44:32,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:32,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642033845] [2019-12-07 13:44:32,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:33,012 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:44:33,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642033845] [2019-12-07 13:44:33,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:33,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:44:33,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991505312] [2019-12-07 13:44:33,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:44:33,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:44:33,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:44:33,013 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 9 states. [2019-12-07 13:44:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:33,214 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-12-07 13:44:33,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:44:33,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-07 13:44:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:33,215 INFO L225 Difference]: With dead ends: 126 [2019-12-07 13:44:33,215 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 13:44:33,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:44:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 13:44:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2019-12-07 13:44:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-07 13:44:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2019-12-07 13:44:33,217 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 19 [2019-12-07 13:44:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:33,217 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2019-12-07 13:44:33,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:44:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2019-12-07 13:44:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:44:33,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:33,218 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:33,218 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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:44:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash 271873202, now seen corresponding path program 1 times [2019-12-07 13:44:33,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:33,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422556727] [2019-12-07 13:44:33,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:33,290 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:44:33,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422556727] [2019-12-07 13:44:33,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127975349] [2019-12-07 13:44:33,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:44:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:33,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 13:44:33,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:33,552 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:44:33,552 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:37,801 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-12-07 13:44:38,285 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 13:44:38,521 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-07 13:44:38,658 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:44:38,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [615311342] [2019-12-07 13:44:38,659 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-12-07 13:44:38,660 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:44:38,660 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:44:38,660 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:44:38,660 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:44:38,824 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:44:38,842 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:44:39,189 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:44:39,620 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:44:39,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:44:39,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 20 [2019-12-07 13:44:39,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637860090] [2019-12-07 13:44:39,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 13:44:39,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:39,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 13:44:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=852, Unknown=2, NotChecked=0, Total=992 [2019-12-07 13:44:39,622 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand 21 states. [2019-12-07 13:44:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:40,267 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2019-12-07 13:44:40,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 13:44:40,267 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2019-12-07 13:44:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:40,268 INFO L225 Difference]: With dead ends: 203 [2019-12-07 13:44:40,268 INFO L226 Difference]: Without dead ends: 203 [2019-12-07 13:44:40,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=278, Invalid=1442, Unknown=2, NotChecked=0, Total=1722 [2019-12-07 13:44:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-12-07 13:44:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 134. [2019-12-07 13:44:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 13:44:40,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 165 transitions. [2019-12-07 13:44:40,271 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 165 transitions. Word has length 19 [2019-12-07 13:44:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:40,271 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 165 transitions. [2019-12-07 13:44:40,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 13:44:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2019-12-07 13:44:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:44:40,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:40,272 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:40,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:44:40,473 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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:44:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 271873203, now seen corresponding path program 1 times [2019-12-07 13:44:40,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:40,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916251001] [2019-12-07 13:44:40,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:40,491 ERROR L253 erpolLogProxyWrapper]: Interpolant 6 not inductive [2019-12-07 13:44:40,495 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:222) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:867) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:269) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:205) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 13:44:40,498 INFO L168 Benchmark]: Toolchain (without parser) took 18527.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 940.7 MB in the beginning and 887.2 MB in the end (delta: 53.5 MB). Peak memory consumption was 382.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:40,499 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:44:40,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -161.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:40,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:40,500 INFO L168 Benchmark]: Boogie Preprocessor took 21.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:44:40,500 INFO L168 Benchmark]: RCFGBuilder took 345.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:40,500 INFO L168 Benchmark]: TraceAbstraction took 17793.83 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.0 GB in the beginning and 887.2 MB in the end (delta: 155.5 MB). Peak memory consumption was 366.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:40,501 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -161.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 345.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17793.83 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.0 GB in the beginning and 887.2 MB in the end (delta: 155.5 MB). Peak memory consumption was 366.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 13:44:41,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:44:41,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:44:41,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:44:41,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:44:41,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:44:41,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:44:41,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:44:41,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:44:41,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:44:41,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:44:41,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:44:41,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:44:41,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:44:41,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:44:41,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:44:41,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:44:41,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:44:41,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:44:41,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:44:41,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:44:41,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:44:41,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:44:41,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:44:41,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:44:41,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:44:41,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:44:41,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:44:41,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:44:41,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:44:41,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:44:41,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:44:41,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:44:41,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:44:41,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:44:41,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:44:41,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:44:41,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:44:41,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:44:41,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:44:41,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:44:41,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 13:44:41,898 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:44:41,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:44:41,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:44:41,899 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:44:41,899 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:44:41,899 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:44:41,900 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:44:41,900 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:44:41,900 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:44:41,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:44:41,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:44:41,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:44:41,901 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:44:41,901 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:44:41,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:44:41,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:44:41,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:44:41,901 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:44:41,901 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:44:41,902 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:44:41,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:44:41,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:44:41,902 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 13:44:41,902 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 13:44:41,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:44:41,902 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:44:41,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:44:41,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:44:41,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:44:41,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:44:41,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:44:41,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:44:41,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:44:41,903 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 13:44:41,903 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 13:44:41,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:44:41,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:44:41,904 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 811c06b4616c360d68e825b8fa9e0b4596e5faf8 [2019-12-07 13:44:42,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:44:42,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:44:42,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:44:42,080 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:44:42,080 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:44:42,081 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-12-07 13:44:42,116 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data/91071cacf/ae8e4febb55d4a1eb225cebd62f2347f/FLAG690a5c0a9 [2019-12-07 13:44:42,554 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:44:42,554 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-12-07 13:44:42,562 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data/91071cacf/ae8e4febb55d4a1eb225cebd62f2347f/FLAG690a5c0a9 [2019-12-07 13:44:42,571 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/data/91071cacf/ae8e4febb55d4a1eb225cebd62f2347f [2019-12-07 13:44:42,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:44:42,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:44:42,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:44:42,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:44:42,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:44:42,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be8526a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42, skipping insertion in model container [2019-12-07 13:44:42,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:44:42,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:44:42,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:44:42,818 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:44:42,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:44:42,878 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:44:42,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42 WrapperNode [2019-12-07 13:44:42,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:44:42,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:44:42,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:44:42,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:44:42,884 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:44:42" (1/1) ... [2019-12-07 13:44:42,897 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:44:42" (1/1) ... [2019-12-07 13:44:42,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:44:42,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:44:42,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:44:42,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:44:42,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (1/1) ... [2019-12-07 13:44:42,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:44:42,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:44:42,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:44:42,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:44:42,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/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:44:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 13:44:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 13:44:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 13:44:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 13:44:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:44:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 13:44:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:44:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:44:43,363 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:44:43,363 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 13:44:43,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:43 BoogieIcfgContainer [2019-12-07 13:44:43,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:44:43,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:44:43,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:44:43,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:44:43,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:44:42" (1/3) ... [2019-12-07 13:44:43,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eeb391b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:44:43, skipping insertion in model container [2019-12-07 13:44:43,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:42" (2/3) ... [2019-12-07 13:44:43,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eeb391b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:44:43, skipping insertion in model container [2019-12-07 13:44:43,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:43" (3/3) ... [2019-12-07 13:44:43,369 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-12-07 13:44:43,375 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:44:43,380 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-12-07 13:44:43,388 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-12-07 13:44:43,400 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:44:43,400 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:44:43,400 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:44:43,400 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:44:43,400 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:44:43,400 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:44:43,401 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:44:43,401 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:44:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-12-07 13:44:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:44:43,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:43,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:44:43,418 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:44:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-12-07 13:44:43,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:43,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742386150] [2019-12-07 13:44:43,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:43,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:44:43,474 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:43,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:43,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:43,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:43,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:43,522 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:44:43,529 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:44:43,530 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:43,532 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:44:43,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742386150] [2019-12-07 13:44:43,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:43,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:44:43,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222440472] [2019-12-07 13:44:43,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:43,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:43,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:43,548 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2019-12-07 13:44:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:43,696 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2019-12-07 13:44:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:43,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:44:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:43,704 INFO L225 Difference]: With dead ends: 105 [2019-12-07 13:44:43,705 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 13:44:43,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:44:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 13:44:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2019-12-07 13:44:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 13:44:43,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2019-12-07 13:44:43,732 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 3 [2019-12-07 13:44:43,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:43,732 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2019-12-07 13:44:43,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2019-12-07 13:44:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:44:43,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:43,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:44:43,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 13:44:43,935 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:44:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:43,936 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 13:44:43,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:43,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710009009] [2019-12-07 13:44:43,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:44,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:44:44,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:44,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:44,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:44,015 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:44,015 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:44,016 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:44:44,025 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:44:44,025 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:44,058 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:44:44,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710009009] [2019-12-07 13:44:44,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:44,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 13:44:44,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503143041] [2019-12-07 13:44:44,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:44,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:44,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:44,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:44,060 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 4 states. [2019-12-07 13:44:44,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:44,266 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-12-07 13:44:44,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:44,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 13:44:44,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:44,268 INFO L225 Difference]: With dead ends: 101 [2019-12-07 13:44:44,268 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 13:44:44,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 13:44:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-12-07 13:44:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 13:44:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2019-12-07 13:44:44,275 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 3 [2019-12-07 13:44:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:44,276 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2019-12-07 13:44:44,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2019-12-07 13:44:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:44:44,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:44,276 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:44,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 13:44:44,478 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:44:44,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1803027162, now seen corresponding path program 1 times [2019-12-07 13:44:44,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:44,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549928954] [2019-12-07 13:44:44,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:44,611 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:44:44,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:44,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:44,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:44,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:44,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:44,621 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:44:44,630 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:44:44,630 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:44,633 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:44:44,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549928954] [2019-12-07 13:44:44,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:44,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 13:44:44,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006681716] [2019-12-07 13:44:44,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:44,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:44,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:44,635 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 4 states. [2019-12-07 13:44:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:44,843 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-12-07 13:44:44,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:44,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 13:44:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:44,845 INFO L225 Difference]: With dead ends: 87 [2019-12-07 13:44:44,845 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 13:44:44,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:44:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 13:44:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2019-12-07 13:44:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 13:44:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-12-07 13:44:44,852 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 7 [2019-12-07 13:44:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:44,852 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-12-07 13:44:44,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-12-07 13:44:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:44:44,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:44,853 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:45,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 13:44:45,054 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:44:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1803027163, now seen corresponding path program 1 times [2019-12-07 13:44:45,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:45,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491464262] [2019-12-07 13:44:45,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:45,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:44:45,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:45,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:45,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:45,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:45,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:45,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:44:45,124 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:44:45,124 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:45,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:44:45,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491464262] [2019-12-07 13:44:45,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:45,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 13:44:45,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257146794] [2019-12-07 13:44:45,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:44:45,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:45,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:44:45,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:44:45,197 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 6 states. [2019-12-07 13:44:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:45,712 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2019-12-07 13:44:45,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:44:45,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 13:44:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:45,714 INFO L225 Difference]: With dead ends: 96 [2019-12-07 13:44:45,715 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 13:44:45,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:44:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 13:44:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2019-12-07 13:44:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 13:44:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-12-07 13:44:45,720 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 7 [2019-12-07 13:44:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:45,720 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-12-07 13:44:45,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:44:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-12-07 13:44:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:44:45,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:45,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:45,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 13:44:45,923 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:44:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1121499220, now seen corresponding path program 1 times [2019-12-07 13:44:45,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:45,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872751924] [2019-12-07 13:44:45,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:45,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:44:45,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:45,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:45,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:45,986 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:45,986 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:45,986 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:44:45,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:45,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:46,002 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:44:46,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 13:44:46,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 13:44:46,015 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:46,018 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,018 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2019-12-07 13:44:46,033 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:44:46,033 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:46,048 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:44:46,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872751924] [2019-12-07 13:44:46,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:46,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 13:44:46,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178097152] [2019-12-07 13:44:46,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:44:46,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:46,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:44:46,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:44:46,050 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2019-12-07 13:44:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:46,539 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2019-12-07 13:44:46,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:44:46,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 13:44:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:46,541 INFO L225 Difference]: With dead ends: 131 [2019-12-07 13:44:46,541 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 13:44:46,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:44:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 13:44:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 80. [2019-12-07 13:44:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 13:44:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-12-07 13:44:46,548 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 10 [2019-12-07 13:44:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:46,548 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-12-07 13:44:46,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:44:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-12-07 13:44:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:44:46,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:46,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:46,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 13:44:46,752 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:44:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1121499221, now seen corresponding path program 1 times [2019-12-07 13:44:46,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:46,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879189884] [2019-12-07 13:44:46,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:46,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:44:46,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:46,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:46,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:46,894 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,894 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:44:46,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:46,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:46,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:46,920 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:46,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,927 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-12-07 13:44:46,943 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 19 treesize of output 11 [2019-12-07 13:44:46,943 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:46,953 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 15 treesize of output 7 [2019-12-07 13:44:46,954 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:46,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:46,958 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-12-07 13:44:46,982 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:44:46,982 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:47,171 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:44:47,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879189884] [2019-12-07 13:44:47,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:47,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 13:44:47,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643902776] [2019-12-07 13:44:47,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:44:47,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:47,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:44:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:44:47,173 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 10 states. [2019-12-07 13:44:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:48,386 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-12-07 13:44:48,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:44:48,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-12-07 13:44:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:48,388 INFO L225 Difference]: With dead ends: 125 [2019-12-07 13:44:48,388 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 13:44:48,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:44:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 13:44:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 69. [2019-12-07 13:44:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 13:44:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-12-07 13:44:48,392 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 10 [2019-12-07 13:44:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:48,392 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-12-07 13:44:48,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:44:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-12-07 13:44:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:44:48,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:48,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:48,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 13:44:48,594 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:44:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:48,595 INFO L82 PathProgramCache]: Analyzing trace with hash 398148861, now seen corresponding path program 1 times [2019-12-07 13:44:48,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:48,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46517466] [2019-12-07 13:44:48,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:48,653 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:44:48,654 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:48,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:48,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:48,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:48,670 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:48,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 13:44:48,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:48,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:48,684 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:48,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:48,691 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:48,691 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-12-07 13:44:48,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:48,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:48,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:48,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:48,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:48,715 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-12-07 13:44:48,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-12-07 13:44:48,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:48,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:48,724 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:44:48,724 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:4 [2019-12-07 13:44:48,734 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:44:48,734 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:48,745 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:44:48,749 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:48,749 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:44:48,749 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-12-07 13:44:48,781 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:44:48,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:48,784 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:44:48,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:13 [2019-12-07 13:44:48,799 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:44:48,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46517466] [2019-12-07 13:44:48,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:48,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-12-07 13:44:48,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597008840] [2019-12-07 13:44:48,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:44:48,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:44:48,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:44:48,800 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 10 states. [2019-12-07 13:44:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:49,297 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2019-12-07 13:44:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:44:49,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-12-07 13:44:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:49,299 INFO L225 Difference]: With dead ends: 150 [2019-12-07 13:44:49,299 INFO L226 Difference]: Without dead ends: 150 [2019-12-07 13:44:49,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:44:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-12-07 13:44:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 74. [2019-12-07 13:44:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 13:44:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-12-07 13:44:49,302 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 11 [2019-12-07 13:44:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:49,303 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-12-07 13:44:49,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:44:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-12-07 13:44:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:44:49,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:49,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:49,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 13:44:49,505 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:44:49,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:49,506 INFO L82 PathProgramCache]: Analyzing trace with hash -542283037, now seen corresponding path program 1 times [2019-12-07 13:44:49,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:49,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47061200] [2019-12-07 13:44:49,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:49,629 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:44:49,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:49,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:49,635 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:49,639 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:44:49,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:49,648 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:49,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,653 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 13:44:49,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:49,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:49,665 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:49,670 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,670 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2019-12-07 13:44:49,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:49,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:49,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:49,694 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,694 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2019-12-07 13:44:49,697 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 15 treesize of output 7 [2019-12-07 13:44:49,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:49,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:49,701 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:44:49,702 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-12-07 13:44:49,713 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:44:49,713 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:49,731 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:44:49,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:49,734 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:44:49,734 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:19 [2019-12-07 13:44:49,799 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:44:49,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:49,802 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:44:49,802 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:14 [2019-12-07 13:44:49,822 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:44:49,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47061200] [2019-12-07 13:44:49,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:49,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-12-07 13:44:49,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015975173] [2019-12-07 13:44:49,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:44:49,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:44:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:44:49,824 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 10 states. [2019-12-07 13:44:52,159 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 13:44:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:52,353 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2019-12-07 13:44:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:44:52,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-12-07 13:44:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:52,354 INFO L225 Difference]: With dead ends: 121 [2019-12-07 13:44:52,355 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 13:44:52,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:44:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 13:44:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2019-12-07 13:44:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 13:44:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2019-12-07 13:44:52,357 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 12 [2019-12-07 13:44:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:52,358 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2019-12-07 13:44:52,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:44:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2019-12-07 13:44:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:44:52,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:52,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:52,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 13:44:52,559 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:44:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:52,559 INFO L82 PathProgramCache]: Analyzing trace with hash -542283036, now seen corresponding path program 1 times [2019-12-07 13:44:52,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:52,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136702594] [2019-12-07 13:44:52,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:52,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 13:44:52,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:52,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:52,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,624 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,625 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 13:44:52,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:52,635 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:52,647 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,654 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-12-07 13:44:52,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:52,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:52,673 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:52,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:52,692 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,702 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:25 [2019-12-07 13:44:52,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:52,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:52,728 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:52,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:52,749 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,757 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,757 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,757 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:25 [2019-12-07 13:44:52,762 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 15 treesize of output 7 [2019-12-07 13:44:52,762 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,771 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 15 treesize of output 7 [2019-12-07 13:44:52,771 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,777 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:11 [2019-12-07 13:44:52,796 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:44:52,796 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:52,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:52,940 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:44:52,949 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:52,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:52,999 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:44:53,004 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:44:53,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:53,030 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 13:44:53,030 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:71 [2019-12-07 13:44:53,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:44:53,271 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:44:53,278 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:53,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:53,325 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:44:53,328 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:44:53,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:53,344 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 13:44:53,344 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:51 [2019-12-07 13:44:53,436 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:44:53,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136702594] [2019-12-07 13:44:53,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:53,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 13:44:53,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948170912] [2019-12-07 13:44:53,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:44:53,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:44:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:44:53,438 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 12 states. [2019-12-07 13:44:54,489 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-12-07 13:44:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:55,154 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2019-12-07 13:44:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:44:55,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-12-07 13:44:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:55,157 INFO L225 Difference]: With dead ends: 148 [2019-12-07 13:44:55,157 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 13:44:55,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:44:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 13:44:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 78. [2019-12-07 13:44:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 13:44:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-12-07 13:44:55,160 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 12 [2019-12-07 13:44:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:55,160 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-12-07 13:44:55,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:44:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-12-07 13:44:55,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:44:55,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:55,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:55,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 13:44:55,362 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:44:55,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:55,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1013123734, now seen corresponding path program 1 times [2019-12-07 13:44:55,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:55,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282812288] [2019-12-07 13:44:55,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:55,462 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 13:44:55,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:55,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:55,469 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:55,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:55,474 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:44:55,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 13:44:55,481 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 16 treesize of output 8 [2019-12-07 13:44:55,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:55,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:55,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:55,483 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 13:44:55,492 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:44:55,492 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:55,494 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:44:55,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282812288] [2019-12-07 13:44:55,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:55,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 13:44:55,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56015421] [2019-12-07 13:44:55,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:44:55,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:44:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:44:55,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:44:55,495 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2019-12-07 13:44:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:55,758 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-12-07 13:44:55,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:44:55,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 13:44:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:55,759 INFO L225 Difference]: With dead ends: 123 [2019-12-07 13:44:55,759 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 13:44:55,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:44:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 13:44:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2019-12-07 13:44:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 13:44:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2019-12-07 13:44:55,761 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 14 [2019-12-07 13:44:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:55,761 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2019-12-07 13:44:55,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:44:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2019-12-07 13:44:55,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:44:55,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:55,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:55,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 13:44:55,963 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:44:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1781880405, now seen corresponding path program 1 times [2019-12-07 13:44:55,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:44:55,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431753739] [2019-12-07 13:44:55,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 13:44:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:56,091 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 13:44:56,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:44:56,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:56,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:44:56,103 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,108 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,109 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 13:44:56,118 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 13:44:56,118 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,126 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-12-07 13:44:56,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:56,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:56,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,147 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-12-07 13:44:56,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:44:56,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-12-07 13:44:56,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,173 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-12-07 13:44:56,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2019-12-07 13:44:56,233 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,254 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:44:56,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,258 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 19 treesize of output 18 [2019-12-07 13:44:56,259 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:44:56,274 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:5 [2019-12-07 13:44:56,285 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:44:56,285 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:44:56,500 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:44:56,542 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:44:56,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:44:56,543 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:86 [2019-12-07 13:45:05,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:45:05,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:45:05,150 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:45:05,150 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:89, output treesize:69 [2019-12-07 13:45:05,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431753739] [2019-12-07 13:45:05,153 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 13:45:05,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [242821715] [2019-12-07 13:45:05,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:45:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:05,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 13:45:05,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:45:05,246 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@68052695 [2019-12-07 13:45:05,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594606072] [2019-12-07 13:45:05,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ac6aac34-8036-4d03-82b7-12c67b937589/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:45:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:45:05,293 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 13:45:05,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:45:05,295 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@68052695 [2019-12-07 13:45:05,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:45:05,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 13:45:05,295 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 13:45:05,295 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:45:05,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 13:45:05,913 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 13:45:05,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:45:05 BoogieIcfgContainer [2019-12-07 13:45:05,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:45:05,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:45:05,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:45:05,914 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:45:05,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:43" (3/4) ... [2019-12-07 13:45:05,917 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:45:05,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:45:05,917 INFO L168 Benchmark]: Toolchain (without parser) took 23343.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 948.4 MB in the beginning and 1.2 GB in the end (delta: -224.7 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:05,918 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:45:05,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:05,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:05,918 INFO L168 Benchmark]: Boogie Preprocessor took 25.63 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:45:05,918 INFO L168 Benchmark]: RCFGBuilder took 426.31 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:05,918 INFO L168 Benchmark]: TraceAbstraction took 22548.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.3 MB). Peak memory consumption was 67.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:45:05,919 INFO L168 Benchmark]: Witness Printer took 2.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:45:05,920 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.63 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 426.31 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: 40.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22548.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.3 MB). Peak memory consumption was 67.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.84 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible 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] x->next->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 46 error locations. Result: UNKNOWN, OverallTime: 22.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 623 SDtfs, 1697 SDslu, 1400 SDs, 0 SdLazy, 1694 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=0, 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, 10 MinimizatonAttempts, 391 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 158 ConstructedInterpolants, 6 QuantifiedInterpolants, 13937 SizeOfPredicates, 58 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...