./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 db17479a00afa98e4ce70a37e790a923b748e4dc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 db17479a00afa98e4ce70a37e790a923b748e4dc ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:37:15,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:37:15,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:37:15,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:37:15,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:37:15,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:37:15,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:37:15,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:37:15,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:37:15,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:37:15,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:37:15,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:37:15,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:37:15,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:37:15,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:37:15,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:37:15,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:37:15,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:37:15,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:37:15,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:37:15,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:37:15,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:37:15,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:37:15,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:37:15,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:37:15,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:37:15,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:37:15,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:37:15,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:37:15,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:37:15,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:37:15,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:37:15,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:37:15,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:37:15,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:37:15,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:37:15,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:37:15,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:37:15,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:37:15,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:37:15,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:37:15,449 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 10:37:15,459 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:37:15,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:37:15,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:37:15,460 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:37:15,460 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:37:15,460 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:37:15,460 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:37:15,461 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:37:15,461 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:37:15,461 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:37:15,461 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:37:15,461 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:37:15,461 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:37:15,461 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:37:15,462 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:37:15,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:37:15,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:37:15,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:37:15,462 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:37:15,462 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:37:15,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:37:15,464 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:37:15,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:37:15,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:37:15,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:37:15,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:37:15,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:37:15,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:37:15,464 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:37:15,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:37:15,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:37:15,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:37:15,465 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_b1404940-c971-492f-9c88-aa57dffb1328/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 -> db17479a00afa98e4ce70a37e790a923b748e4dc [2019-12-07 10:37:15,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:37:15,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:37:15,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:37:15,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:37:15,575 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:37:15,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 10:37:15,617 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data/1a9f86d5e/f58dbdfe397b4a2dad1148c1c2e034de/FLAG1e58f7ba2 [2019-12-07 10:37:16,020 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:37:16,020 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 10:37:16,029 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data/1a9f86d5e/f58dbdfe397b4a2dad1148c1c2e034de/FLAG1e58f7ba2 [2019-12-07 10:37:16,397 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data/1a9f86d5e/f58dbdfe397b4a2dad1148c1c2e034de [2019-12-07 10:37:16,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:37:16,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:37:16,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:37:16,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:37:16,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:37:16,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692c87d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16, skipping insertion in model container [2019-12-07 10:37:16,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:37:16,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:37:16,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:37:16,662 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:37:16,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:37:16,723 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:37:16,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16 WrapperNode [2019-12-07 10:37:16,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:37:16,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:37:16,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:37:16,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:37:16,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:37:16,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:37:16,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:37:16,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:37:16,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... [2019-12-07 10:37:16,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:37:16,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:37:16,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:37:16,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:37:16,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:37:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:37:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:37:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:37:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:37:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:37:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:37:16,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:37:16,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:37:17,177 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:37:17,177 INFO L287 CfgBuilder]: Removed 26 assume(true) statements. [2019-12-07 10:37:17,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:37:17 BoogieIcfgContainer [2019-12-07 10:37:17,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:37:17,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:37:17,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:37:17,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:37:17,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:37:16" (1/3) ... [2019-12-07 10:37:17,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e87ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:37:17, skipping insertion in model container [2019-12-07 10:37:17,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:37:16" (2/3) ... [2019-12-07 10:37:17,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e87ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:37:17, skipping insertion in model container [2019-12-07 10:37:17,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:37:17" (3/3) ... [2019-12-07 10:37:17,183 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2019-12-07 10:37:17,189 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:37:17,193 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-12-07 10:37:17,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-12-07 10:37:17,213 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:37:17,214 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:37:17,214 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:37:17,214 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:37:17,214 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:37:17,214 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:37:17,214 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:37:17,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:37:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-12-07 10:37:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:37:17,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:17,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:37:17,230 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 211679, now seen corresponding path program 1 times [2019-12-07 10:37:17,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:17,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921073896] [2019-12-07 10:37:17,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:17,343 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 10:37:17,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921073896] [2019-12-07 10:37:17,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:17,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:37:17,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824390565] [2019-12-07 10:37:17,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:37:17,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:37:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:17,359 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2019-12-07 10:37:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:17,435 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-12-07 10:37:17,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:37:17,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:37:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:17,443 INFO L225 Difference]: With dead ends: 83 [2019-12-07 10:37:17,443 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 10:37:17,444 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 10:37:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 10:37:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2019-12-07 10:37:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 10:37:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-12-07 10:37:17,468 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 3 [2019-12-07 10:37:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:17,468 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-12-07 10:37:17,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:37:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-12-07 10:37:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:37:17,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:17,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:37:17,469 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash 211680, now seen corresponding path program 1 times [2019-12-07 10:37:17,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:17,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443889775] [2019-12-07 10:37:17,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:17,504 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 10:37:17,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443889775] [2019-12-07 10:37:17,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:17,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:37:17,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946614418] [2019-12-07 10:37:17,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:37:17,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:17,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:37:17,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:17,506 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 3 states. [2019-12-07 10:37:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:17,542 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-12-07 10:37:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:37:17,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:37:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:17,544 INFO L225 Difference]: With dead ends: 56 [2019-12-07 10:37:17,544 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 10:37:17,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 10:37:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 10:37:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 10:37:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-12-07 10:37:17,550 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 3 [2019-12-07 10:37:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:17,550 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-12-07 10:37:17,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:37:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-12-07 10:37:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 10:37:17,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:17,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 10:37:17,551 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:17,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:17,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2011326641, now seen corresponding path program 1 times [2019-12-07 10:37:17,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:17,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497965989] [2019-12-07 10:37:17,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:17,588 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 10:37:17,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497965989] [2019-12-07 10:37:17,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:17,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:37:17,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537296330] [2019-12-07 10:37:17,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:37:17,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:17,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:37:17,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:17,590 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 3 states. [2019-12-07 10:37:17,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:17,599 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-12-07 10:37:17,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:37:17,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 10:37:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:17,600 INFO L225 Difference]: With dead ends: 57 [2019-12-07 10:37:17,600 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 10:37:17,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:37:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 10:37:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 10:37:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 10:37:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-12-07 10:37:17,604 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 6 [2019-12-07 10:37:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:17,605 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-12-07 10:37:17,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:37:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-12-07 10:37:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:37:17,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:17,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:17,605 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:17,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:17,606 INFO L82 PathProgramCache]: Analyzing trace with hash 181996205, now seen corresponding path program 1 times [2019-12-07 10:37:17,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:17,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837216350] [2019-12-07 10:37:17,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:17,639 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 10:37:17,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837216350] [2019-12-07 10:37:17,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:17,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:37:17,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135203949] [2019-12-07 10:37:17,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:37:17,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:17,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:37:17,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:37:17,641 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 4 states. [2019-12-07 10:37:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:17,708 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-12-07 10:37:17,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:37:17,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 10:37:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:17,709 INFO L225 Difference]: With dead ends: 78 [2019-12-07 10:37:17,709 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 10:37:17,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:37:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 10:37:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2019-12-07 10:37:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 10:37:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-12-07 10:37:17,714 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 9 [2019-12-07 10:37:17,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:17,714 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-12-07 10:37:17,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:37:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-12-07 10:37:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:37:17,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:17,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:17,715 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash 181996206, now seen corresponding path program 1 times [2019-12-07 10:37:17,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:17,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471809270] [2019-12-07 10:37:17,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:17,759 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 10:37:17,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471809270] [2019-12-07 10:37:17,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:17,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:37:17,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437429282] [2019-12-07 10:37:17,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:37:17,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:17,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:37:17,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:37:17,760 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 4 states. [2019-12-07 10:37:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:17,802 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-12-07 10:37:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:37:17,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 10:37:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:17,803 INFO L225 Difference]: With dead ends: 58 [2019-12-07 10:37:17,803 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 10:37:17,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 10:37:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 10:37:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-12-07 10:37:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 10:37:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-12-07 10:37:17,807 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 9 [2019-12-07 10:37:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:17,807 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-12-07 10:37:17,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:37:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-12-07 10:37:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:37:17,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:17,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:17,808 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1195164347, now seen corresponding path program 1 times [2019-12-07 10:37:17,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:17,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556996471] [2019-12-07 10:37:17,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:37:17,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556996471] [2019-12-07 10:37:17,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:17,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:37:17,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084594590] [2019-12-07 10:37:17,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:37:17,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:37:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:37:17,864 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 6 states. [2019-12-07 10:37:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:17,920 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-12-07 10:37:17,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:37:17,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 10:37:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:17,921 INFO L225 Difference]: With dead ends: 73 [2019-12-07 10:37:17,922 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 10:37:17,922 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 10:37:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 10:37:17,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2019-12-07 10:37:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 10:37:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-12-07 10:37:17,926 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 11 [2019-12-07 10:37:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:17,926 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-12-07 10:37:17,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:37:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-12-07 10:37:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:37:17,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:17,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:17,927 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:17,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1195164346, now seen corresponding path program 1 times [2019-12-07 10:37:17,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:17,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943513130] [2019-12-07 10:37:17,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:37:17,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943513130] [2019-12-07 10:37:17,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:17,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:37:17,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681895728] [2019-12-07 10:37:17,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:37:17,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:37:17,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:37:17,982 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2019-12-07 10:37:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:18,022 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-12-07 10:37:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:37:18,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:37:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:18,023 INFO L225 Difference]: With dead ends: 53 [2019-12-07 10:37:18,023 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 10:37:18,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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 10:37:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 10:37:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 10:37:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 10:37:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-12-07 10:37:18,026 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 11 [2019-12-07 10:37:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:18,027 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-12-07 10:37:18,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:37:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-12-07 10:37:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:37:18,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:18,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:18,028 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash 142150231, now seen corresponding path program 1 times [2019-12-07 10:37:18,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:18,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620003526] [2019-12-07 10:37:18,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:18,067 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 10:37:18,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620003526] [2019-12-07 10:37:18,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:18,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:37:18,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176914558] [2019-12-07 10:37:18,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:37:18,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:18,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:37:18,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:37:18,068 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2019-12-07 10:37:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:18,175 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2019-12-07 10:37:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:37:18,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:37:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:18,177 INFO L225 Difference]: With dead ends: 112 [2019-12-07 10:37:18,177 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 10:37:18,177 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 10:37:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 10:37:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 56. [2019-12-07 10:37:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 10:37:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-12-07 10:37:18,183 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 14 [2019-12-07 10:37:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:18,183 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-12-07 10:37:18,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:37:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-12-07 10:37:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:37:18,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:18,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:18,185 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash 142150232, now seen corresponding path program 1 times [2019-12-07 10:37:18,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:18,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301537264] [2019-12-07 10:37:18,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:18,272 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 10:37:18,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301537264] [2019-12-07 10:37:18,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820161478] [2019-12-07 10:37:18,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:37:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:18,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:37:18,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:37:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:37:18,374 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:37:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:37:18,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:37:18,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 10 [2019-12-07 10:37:18,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015107141] [2019-12-07 10:37:18,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:37:18,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:18,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:37:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:37:18,397 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 5 states. [2019-12-07 10:37:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:18,442 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2019-12-07 10:37:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:37:18,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:37:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:18,443 INFO L225 Difference]: With dead ends: 77 [2019-12-07 10:37:18,443 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 10:37:18,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:37:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 10:37:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-12-07 10:37:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 10:37:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-12-07 10:37:18,446 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 14 [2019-12-07 10:37:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:18,446 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-12-07 10:37:18,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:37:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-12-07 10:37:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:37:18,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:18,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:18,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:37:18,648 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:18,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:18,649 INFO L82 PathProgramCache]: Analyzing trace with hash 142146319, now seen corresponding path program 1 times [2019-12-07 10:37:18,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:18,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963158413] [2019-12-07 10:37:18,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:37:18,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963158413] [2019-12-07 10:37:18,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:18,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:37:18,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448358020] [2019-12-07 10:37:18,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:37:18,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:18,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:37:18,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:37:18,776 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 7 states. [2019-12-07 10:37:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:18,936 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2019-12-07 10:37:18,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:37:18,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 10:37:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:18,937 INFO L225 Difference]: With dead ends: 98 [2019-12-07 10:37:18,937 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 10:37:18,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:37:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 10:37:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 59. [2019-12-07 10:37:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 10:37:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2019-12-07 10:37:18,941 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2019-12-07 10:37:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:18,941 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2019-12-07 10:37:18,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:37:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2019-12-07 10:37:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:37:18,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:18,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:18,942 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:18,942 INFO L82 PathProgramCache]: Analyzing trace with hash -836222225, now seen corresponding path program 1 times [2019-12-07 10:37:18,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:18,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602699572] [2019-12-07 10:37:18,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:19,039 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 10:37:19,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602699572] [2019-12-07 10:37:19,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377538188] [2019-12-07 10:37:19,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:37:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:19,090 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 10:37:19,091 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:37:19,126 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:37:19,127 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 11 treesize of output 15 [2019-12-07 10:37:19,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:37:19,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:37:19,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:37:19,131 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 10:37:19,137 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 10:37:19,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:37:19,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:37:19,141 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:37:19,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 10:37:19,171 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:37:19,172 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 10:37:19,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:37:19,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:37:19,175 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:37:19,190 INFO L614 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-12-07 10:37:19,190 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 10:37:19,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 10:37:19,236 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:37:19,237 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 36 treesize of output 31 [2019-12-07 10:37:19,237 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:37:19,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:37:19,240 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 10:37:19,241 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-12-07 10:37:19,242 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 10:37:19,242 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:37:19,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:37:19,252 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 10:37:19,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:37:19,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:37:19,255 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:37:19,256 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:37:19,256 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2019-12-07 10:37:19,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:37:19,290 INFO L614 ElimStorePlain]: treesize reduction 10, result has 52.4 percent of original size [2019-12-07 10:37:19,290 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 10:37:19,290 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-12-07 10:37:19,321 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 10:37:19,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1558293114] [2019-12-07 10:37:19,336 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 10:37:19,336 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:37:19,340 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:37:19,345 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:37:19,345 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:37:19,419 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:19,588 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:19,767 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:19,797 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:20,145 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:20,158 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:20,170 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:20,600 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:20,635 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:20,641 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:20,671 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:37:20,954 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 10:37:21,566 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 109 [2019-12-07 10:37:21,767 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-12-07 10:37:21,979 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-12-07 10:37:22,249 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-12-07 10:37:22,779 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 97 [2019-12-07 10:37:23,245 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 114 [2019-12-07 10:37:24,456 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 224 DAG size of output: 135 [2019-12-07 10:37:24,977 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 129 [2019-12-07 10:37:25,857 WARN L192 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 131 [2019-12-07 10:37:25,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:37:25,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9, 9, 7] total 26 [2019-12-07 10:37:25,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34857985] [2019-12-07 10:37:25,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:37:25,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:25,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:37:25,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-07 10:37:25,859 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 13 states. [2019-12-07 10:37:26,094 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-12-07 10:37:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:26,425 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-12-07 10:37:26,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:37:26,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-07 10:37:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:26,426 INFO L225 Difference]: With dead ends: 62 [2019-12-07 10:37:26,426 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 10:37:26,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2019-12-07 10:37:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 10:37:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-12-07 10:37:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 10:37:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-12-07 10:37:26,430 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 16 [2019-12-07 10:37:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:26,430 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-12-07 10:37:26,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:37:26,430 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-12-07 10:37:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:37:26,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:26,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:26,631 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:37:26,632 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:26,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:26,633 INFO L82 PathProgramCache]: Analyzing trace with hash 797073822, now seen corresponding path program 1 times [2019-12-07 10:37:26,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:26,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335920637] [2019-12-07 10:37:26,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:37:26,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335920637] [2019-12-07 10:37:26,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:26,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:37:26,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360512780] [2019-12-07 10:37:26,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:37:26,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:37:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:37:26,664 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 5 states. [2019-12-07 10:37:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:26,727 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-12-07 10:37:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:37:26,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-07 10:37:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:26,728 INFO L225 Difference]: With dead ends: 85 [2019-12-07 10:37:26,728 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 10:37:26,728 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 10:37:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 10:37:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2019-12-07 10:37:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 10:37:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-12-07 10:37:26,731 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 20 [2019-12-07 10:37:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:26,731 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-12-07 10:37:26,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:37:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-12-07 10:37:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:37:26,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:26,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:26,732 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:26,732 INFO L82 PathProgramCache]: Analyzing trace with hash 797073823, now seen corresponding path program 1 times [2019-12-07 10:37:26,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:26,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638880175] [2019-12-07 10:37:26,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:37:26,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638880175] [2019-12-07 10:37:26,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427294291] [2019-12-07 10:37:26,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:37:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:26,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:37:26,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:37:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:37:26,850 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:37:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:37:26,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1306049850] [2019-12-07 10:37:26,866 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-12-07 10:37:26,866 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:37:26,867 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:37:26,867 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:37:26,867 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:37:26,911 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:27,017 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:27,139 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:27,163 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:27,475 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:27,485 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:27,494 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:27,570 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:28,548 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:28,584 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:28,592 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:28,625 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:37:29,417 WARN L192 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 124 [2019-12-07 10:37:29,647 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-12-07 10:37:29,988 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-12-07 10:37:30,299 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-12-07 10:37:30,852 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 108 [2019-12-07 10:37:32,203 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 201 DAG size of output: 150 [2019-12-07 10:37:32,776 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 129 [2019-12-07 10:37:32,975 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-07 10:37:33,506 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 91 [2019-12-07 10:37:34,083 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 107 [2019-12-07 10:37:34,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:37:34,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [8, 4, 4] total 23 [2019-12-07 10:37:34,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346299856] [2019-12-07 10:37:34,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:37:34,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:37:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:37:34,086 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 14 states. [2019-12-07 10:37:34,640 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 87 [2019-12-07 10:37:35,846 WARN L192 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 150 [2019-12-07 10:37:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:36,475 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-12-07 10:37:36,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:37:36,476 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-12-07 10:37:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:36,477 INFO L225 Difference]: With dead ends: 112 [2019-12-07 10:37:36,477 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 10:37:36,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:37:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 10:37:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 62. [2019-12-07 10:37:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 10:37:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2019-12-07 10:37:36,479 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 20 [2019-12-07 10:37:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:36,479 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2019-12-07 10:37:36,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:37:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2019-12-07 10:37:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:37:36,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:36,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:36,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:37:36,682 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:36,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:36,682 INFO L82 PathProgramCache]: Analyzing trace with hash 797070871, now seen corresponding path program 1 times [2019-12-07 10:37:36,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:36,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540646785] [2019-12-07 10:37:36,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:37:36,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540646785] [2019-12-07 10:37:36,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621926674] [2019-12-07 10:37:36,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:37:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:36,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:37:36,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:37:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:37:36,780 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:37:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:37:36,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1434663560] [2019-12-07 10:37:36,792 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-12-07 10:37:36,792 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:37:36,792 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:37:36,792 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:37:36,792 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:37:36,829 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:36,929 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:37,041 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:37,051 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:37,323 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:37,335 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:37,345 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:37,427 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:38,370 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:38,414 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:38,421 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:38,448 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:37:38,989 WARN L192 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 111 [2019-12-07 10:37:39,728 WARN L192 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 125 [2019-12-07 10:37:39,937 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-12-07 10:37:40,172 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-12-07 10:37:40,412 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-12-07 10:37:40,878 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 110 [2019-12-07 10:37:41,667 WARN L192 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 165 [2019-12-07 10:37:42,148 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 130 [2019-12-07 10:37:42,336 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-07 10:37:42,873 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 92 [2019-12-07 10:37:43,474 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 108 [2019-12-07 10:37:43,592 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:37:43,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:37:43,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2019-12-07 10:37:43,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078323349] [2019-12-07 10:37:43,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:37:43,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:43,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:37:43,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:37:43,593 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2019-12-07 10:37:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:43,678 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-12-07 10:37:43,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:37:43,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 10:37:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:43,679 INFO L225 Difference]: With dead ends: 76 [2019-12-07 10:37:43,679 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 10:37:43,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:37:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 10:37:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2019-12-07 10:37:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 10:37:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2019-12-07 10:37:43,681 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 20 [2019-12-07 10:37:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:43,682 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2019-12-07 10:37:43,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:37:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2019-12-07 10:37:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:37:43,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:43,682 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:43,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:37:43,883 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1185017877, now seen corresponding path program 1 times [2019-12-07 10:37:43,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:43,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544409480] [2019-12-07 10:37:43,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:37:43,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544409480] [2019-12-07 10:37:43,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528492649] [2019-12-07 10:37:43,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:37:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:43,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:37:43,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:37:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:37:43,960 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:37:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:37:43,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [706465290] [2019-12-07 10:37:43,970 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 10:37:43,971 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:37:43,971 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:37:43,971 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:37:43,971 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:37:44,005 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:44,098 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:44,210 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:44,231 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:44,499 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:44,509 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:44,518 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:44,597 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:45,444 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:45,475 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:45,482 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:45,510 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:37:45,695 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-12-07 10:37:46,336 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 108 [2019-12-07 10:37:46,519 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-12-07 10:37:46,699 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-12-07 10:37:46,937 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-12-07 10:37:47,343 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 97 [2019-12-07 10:37:48,319 WARN L192 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 162 [2019-12-07 10:37:48,784 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 129 [2019-12-07 10:37:48,977 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 10:37:48,977 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:37:48,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:37:48,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2019-12-07 10:37:48,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122319418] [2019-12-07 10:37:48,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:37:48,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:48,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:37:48,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:37:48,978 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 6 states. [2019-12-07 10:37:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:49,039 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2019-12-07 10:37:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:37:49,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 10:37:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:49,040 INFO L225 Difference]: With dead ends: 71 [2019-12-07 10:37:49,040 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 10:37:49,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-07 10:37:49,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 10:37:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-12-07 10:37:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 10:37:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2019-12-07 10:37:49,041 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 21 [2019-12-07 10:37:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:49,042 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2019-12-07 10:37:49,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:37:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2019-12-07 10:37:49,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 10:37:49,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:49,042 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:49,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:37:49,243 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1329092741, now seen corresponding path program 2 times [2019-12-07 10:37:49,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:49,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366812458] [2019-12-07 10:37:49,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 10:37:49,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366812458] [2019-12-07 10:37:49,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:37:49,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:37:49,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286026461] [2019-12-07 10:37:49,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:37:49,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:37:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:37:49,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:37:49,312 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 7 states. [2019-12-07 10:37:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:37:49,409 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-12-07 10:37:49,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:37:49,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-07 10:37:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:37:49,410 INFO L225 Difference]: With dead ends: 92 [2019-12-07 10:37:49,410 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 10:37:49,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:37:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 10:37:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 65. [2019-12-07 10:37:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 10:37:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-12-07 10:37:49,412 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 23 [2019-12-07 10:37:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:37:49,412 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-12-07 10:37:49,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:37:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-12-07 10:37:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:37:49,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:37:49,413 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:37:49,413 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:37:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:37:49,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1652755853, now seen corresponding path program 1 times [2019-12-07 10:37:49,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:37:49,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308702812] [2019-12-07 10:37:49,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:37:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:37:49,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308702812] [2019-12-07 10:37:49,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856838389] [2019-12-07 10:37:49,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:37:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:37:49,637 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-07 10:37:49,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:37:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:37:49,935 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:37:57,815 WARN L192 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 10:37:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:37:57,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734989754] [2019-12-07 10:37:57,996 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 10:37:57,996 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:37:57,996 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:37:57,996 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:37:57,996 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:37:58,031 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:58,128 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:58,254 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:58,278 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:58,530 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:58,540 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:58,568 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:58,642 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:59,643 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:59,693 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:59,700 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:37:59,730 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:38:00,010 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2019-12-07 10:38:00,443 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-07 10:38:01,039 WARN L192 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 108 [2019-12-07 10:38:01,314 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2019-12-07 10:38:01,623 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-12-07 10:38:01,887 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-12-07 10:38:02,319 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 97 [2019-12-07 10:38:03,169 WARN L192 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 164 [2019-12-07 10:38:03,743 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 129 [2019-12-07 10:38:03,985 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-07 10:38:04,599 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 93 [2019-12-07 10:38:04,895 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-12-07 10:38:05,209 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-12-07 10:38:05,519 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-12-07 10:38:05,519 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:38:05,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:38:05,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 30 [2019-12-07 10:38:05,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43755713] [2019-12-07 10:38:05,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 10:38:05,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:05,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 10:38:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1865, Unknown=2, NotChecked=0, Total=2070 [2019-12-07 10:38:05,521 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 31 states. [2019-12-07 10:38:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:06,649 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2019-12-07 10:38:06,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 10:38:06,649 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 25 [2019-12-07 10:38:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:06,650 INFO L225 Difference]: With dead ends: 119 [2019-12-07 10:38:06,650 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 10:38:06,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=384, Invalid=2920, Unknown=2, NotChecked=0, Total=3306 [2019-12-07 10:38:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 10:38:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 71. [2019-12-07 10:38:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 10:38:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2019-12-07 10:38:06,653 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 25 [2019-12-07 10:38:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:06,653 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2019-12-07 10:38:06,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 10:38:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2019-12-07 10:38:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:38:06,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:06,654 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:06,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:06,855 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:06,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1652755852, now seen corresponding path program 1 times [2019-12-07 10:38:06,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:06,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242137950] [2019-12-07 10:38:06,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:38:07,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242137950] [2019-12-07 10:38:07,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398883954] [2019-12-07 10:38:07,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:07,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-07 10:38:07,168 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:38:07,609 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:38:08,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1239149614] [2019-12-07 10:38:08,656 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 10:38:08,656 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:38:08,657 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:38:08,657 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:38:08,657 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:38:08,680 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:08,770 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:08,886 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:08,897 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:09,157 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:09,167 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:09,199 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:09,271 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:10,252 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:10,305 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:10,312 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 10:38:10,338 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:38:10,644 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2019-12-07 10:38:11,713 WARN L192 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 125 [2019-12-07 10:38:12,063 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-12-07 10:38:12,443 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-12-07 10:38:12,764 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-12-07 10:38:13,313 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2019-12-07 10:38:14,470 WARN L192 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 163 [2019-12-07 10:38:15,036 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 130 [2019-12-07 10:38:15,301 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-07 10:38:16,009 WARN L192 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 93 [2019-12-07 10:38:16,343 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-12-07 10:38:16,679 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-12-07 10:38:17,118 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-12-07 10:38:17,118 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:38:17,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:38:17,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2019-12-07 10:38:17,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426248091] [2019-12-07 10:38:17,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-07 10:38:17,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:17,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-07 10:38:17,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2615, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 10:38:17,121 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 39 states. [2019-12-07 10:38:18,343 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-12-07 10:38:18,672 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-12-07 10:38:19,052 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2019-12-07 10:38:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:20,304 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2019-12-07 10:38:20,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:38:20,305 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 25 [2019-12-07 10:38:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:20,306 INFO L225 Difference]: With dead ends: 184 [2019-12-07 10:38:20,306 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 10:38:20,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=588, Invalid=4242, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 10:38:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 10:38:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 70. [2019-12-07 10:38:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 10:38:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2019-12-07 10:38:20,310 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 25 [2019-12-07 10:38:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:20,311 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2019-12-07 10:38:20,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-07 10:38:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2019-12-07 10:38:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:38:20,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:20,311 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:20,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:20,512 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:20,513 INFO L82 PathProgramCache]: Analyzing trace with hash 839594120, now seen corresponding path program 1 times [2019-12-07 10:38:20,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:38:20,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575699281] [2019-12-07 10:38:20,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:38:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:38:20,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575699281] [2019-12-07 10:38:20,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690908486] [2019-12-07 10:38:20,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:20,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 85 conjunts are in the unsatisfiable core [2019-12-07 10:38:20,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:38:21,735 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:22,569 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-12-07 10:38:23,880 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 219 DAG size of output: 46 [2019-12-07 10:38:24,109 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@68a663ab [2019-12-07 10:38:24,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [344151999] [2019-12-07 10:38:24,110 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-12-07 10:38:24,110 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:38:24,110 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:38:24,110 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:38:24,111 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:38:24,118 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@68a663ab at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) 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 10:38:24,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:38:24,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-12-07 10:38:24,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365885262] [2019-12-07 10:38:24,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 10:38:24,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:38:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 10:38:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 10:38:24,122 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 18 states. [2019-12-07 10:38:24,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:38:24,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:24,323 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@68a663ab at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) 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 10:38:24,324 INFO L168 Benchmark]: Toolchain (without parser) took 67923.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 366.5 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 168.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:24,325 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:38:24,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:24,325 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:24,325 INFO L168 Benchmark]: Boogie Preprocessor took 22.60 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 10:38:24,325 INFO L168 Benchmark]: RCFGBuilder took 398.07 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:24,325 INFO L168 Benchmark]: TraceAbstraction took 67144.96 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -101.2 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:38:24,326 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.60 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 398.07 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67144.96 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -101.2 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@68a663ab de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@68a663ab: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) 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 10:38:25,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:38:25,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:38:25,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:38:25,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:38:25,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:38:25,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:38:25,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:38:25,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:38:25,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:38:25,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:38:25,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:38:25,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:38:25,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:38:25,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:38:25,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:38:25,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:38:25,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:38:25,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:38:25,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:38:25,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:38:25,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:38:25,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:38:25,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:38:25,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:38:25,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:38:25,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:38:25,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:38:25,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:38:25,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:38:25,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:38:25,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:38:25,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:38:25,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:38:25,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:38:25,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:38:25,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:38:25,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:38:25,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:38:25,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:38:25,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:38:25,667 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 10:38:25,677 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:38:25,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:38:25,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:38:25,678 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:38:25,678 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:38:25,678 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:38:25,678 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:38:25,678 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:38:25,678 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:38:25,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:38:25,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:38:25,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:38:25,679 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:38:25,679 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 10:38:25,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:38:25,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:38:25,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:38:25,680 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 10:38:25,680 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 10:38:25,680 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 10:38:25,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:38:25,680 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:38:25,681 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:38:25,681 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:38:25,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:38:25,681 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:38:25,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:38:25,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:38:25,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:38:25,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:38:25,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:38:25,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:38:25,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:38:25,682 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 10:38:25,682 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:38:25,682 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:38:25,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:38:25,682 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_b1404940-c971-492f-9c88-aa57dffb1328/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 -> db17479a00afa98e4ce70a37e790a923b748e4dc [2019-12-07 10:38:25,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:38:25,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:38:25,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:38:25,856 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:38:25,857 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:38:25,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 10:38:25,897 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data/9a21ba4aa/f691fc86e23c4b1895c160e354511940/FLAG276265136 [2019-12-07 10:38:26,296 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:38:26,297 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2019-12-07 10:38:26,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data/9a21ba4aa/f691fc86e23c4b1895c160e354511940/FLAG276265136 [2019-12-07 10:38:26,314 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/data/9a21ba4aa/f691fc86e23c4b1895c160e354511940 [2019-12-07 10:38:26,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:38:26,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:38:26,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:38:26,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:38:26,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:38:26,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5031311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26, skipping insertion in model container [2019-12-07 10:38:26,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:38:26,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:38:26,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:38:26,568 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:38:26,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:38:26,636 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:38:26,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26 WrapperNode [2019-12-07 10:38:26,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:38:26,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:38:26,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:38:26,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:38:26,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:38:26,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:38:26,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:38:26,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:38:26,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... [2019-12-07 10:38:26,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:38:26,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:38:26,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:38:26,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:38:26,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 10:38:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 10:38:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 10:38:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 10:38:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:38:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 10:38:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:38:26,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:38:27,090 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:38:27,090 INFO L287 CfgBuilder]: Removed 26 assume(true) statements. [2019-12-07 10:38:27,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:38:27 BoogieIcfgContainer [2019-12-07 10:38:27,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:38:27,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:38:27,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:38:27,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:38:27,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:38:26" (1/3) ... [2019-12-07 10:38:27,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c461a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:38:27, skipping insertion in model container [2019-12-07 10:38:27,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:38:26" (2/3) ... [2019-12-07 10:38:27,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c461a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:38:27, skipping insertion in model container [2019-12-07 10:38:27,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:38:27" (3/3) ... [2019-12-07 10:38:27,098 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2019-12-07 10:38:27,104 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:38:27,109 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-12-07 10:38:27,117 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-12-07 10:38:27,129 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:38:27,129 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 10:38:27,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:38:27,130 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:38:27,130 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:38:27,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:38:27,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:38:27,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:38:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-12-07 10:38:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 10:38:27,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:27,147 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 10:38:27,148 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:27,152 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-12-07 10:38:27,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:27,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735448549] [2019-12-07 10:38:27,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:27,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:38:27,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:27,244 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 10:38:27,244 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:27,249 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:27,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:27,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:38:27,255 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 10:38:27,255 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:27,258 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 10:38:27,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735448549] [2019-12-07 10:38:27,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:27,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:38:27,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954585583] [2019-12-07 10:38:27,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:38:27,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:27,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:38:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:38:27,275 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-12-07 10:38:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:27,424 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-12-07 10:38:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:38:27,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 10:38:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:27,433 INFO L225 Difference]: With dead ends: 104 [2019-12-07 10:38:27,433 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 10:38:27,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 10:38:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 10:38:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2019-12-07 10:38:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 10:38:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-12-07 10:38:27,462 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 4 [2019-12-07 10:38:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:27,463 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-12-07 10:38:27,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:38:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-12-07 10:38:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 10:38:27,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:27,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 10:38:27,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:38:27,664 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:27,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:27,664 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-12-07 10:38:27,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:27,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609040826] [2019-12-07 10:38:27,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:27,700 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:38:27,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:27,710 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 10:38:27,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:27,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:27,715 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:27,715 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:38:27,722 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 10:38:27,722 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:27,758 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 10:38:27,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609040826] [2019-12-07 10:38:27,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:27,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 10:38:27,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585574646] [2019-12-07 10:38:27,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:38:27,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:27,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:38:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:38:27,761 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 4 states. [2019-12-07 10:38:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:27,867 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-12-07 10:38:27,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:38:27,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 10:38:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:27,869 INFO L225 Difference]: With dead ends: 74 [2019-12-07 10:38:27,869 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 10:38:27,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 10:38:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 10:38:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 10:38:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 10:38:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-12-07 10:38:27,875 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 4 [2019-12-07 10:38:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:27,875 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-12-07 10:38:27,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:38:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-12-07 10:38:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:38:27,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:27,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:28,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:38:28,077 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2097994085, now seen corresponding path program 1 times [2019-12-07 10:38:28,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:28,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879862674] [2019-12-07 10:38:28,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:28,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:38:28,141 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:28,147 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 10:38:28,147 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:28,153 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 10:38:28,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879862674] [2019-12-07 10:38:28,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:28,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:38:28,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78691598] [2019-12-07 10:38:28,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:38:28,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:38:28,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:38:28,154 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-12-07 10:38:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:28,166 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-12-07 10:38:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:38:28,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 10:38:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:28,168 INFO L225 Difference]: With dead ends: 84 [2019-12-07 10:38:28,168 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 10:38:28,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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 10:38:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 10:38:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-12-07 10:38:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 10:38:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-12-07 10:38:28,173 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 9 [2019-12-07 10:38:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:28,174 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-12-07 10:38:28,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:38:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-12-07 10:38:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:38:28,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:28,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:28,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:38:28,376 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:28,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash 231455864, now seen corresponding path program 1 times [2019-12-07 10:38:28,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:28,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125062204] [2019-12-07 10:38:28,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:28,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:38:28,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:28,477 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 10:38:28,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:28,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:28,480 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:28,480 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:38:28,495 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 10:38:28,495 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:28,507 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 10:38:28,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125062204] [2019-12-07 10:38:28,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:28,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 10:38:28,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416083366] [2019-12-07 10:38:28,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:38:28,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:28,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:38:28,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:38:28,509 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 5 states. [2019-12-07 10:38:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:28,734 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-12-07 10:38:28,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:38:28,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:38:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:28,735 INFO L225 Difference]: With dead ends: 99 [2019-12-07 10:38:28,735 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 10:38:28,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 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 10:38:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 10:38:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2019-12-07 10:38:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 10:38:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-12-07 10:38:28,742 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 14 [2019-12-07 10:38:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:28,742 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-12-07 10:38:28,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:38:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-12-07 10:38:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:38:28,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:28,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:28,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:38:28,945 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:28,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:28,946 INFO L82 PathProgramCache]: Analyzing trace with hash 231455865, now seen corresponding path program 1 times [2019-12-07 10:38:28,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:28,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977804664] [2019-12-07 10:38:28,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:29,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 10:38:29,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:29,035 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 10:38:29,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:29,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:29,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:29,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:38:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:38:29,069 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:29,183 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 10:38:29,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977804664] [2019-12-07 10:38:29,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:29,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 10:38:29,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805401181] [2019-12-07 10:38:29,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:38:29,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:38:29,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:38:29,185 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 8 states. [2019-12-07 10:38:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:29,516 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-12-07 10:38:29,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:38:29,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 10:38:29,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:29,518 INFO L225 Difference]: With dead ends: 78 [2019-12-07 10:38:29,518 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 10:38:29,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:38:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 10:38:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2019-12-07 10:38:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 10:38:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-12-07 10:38:29,523 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 14 [2019-12-07 10:38:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:29,524 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-12-07 10:38:29,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:38:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-12-07 10:38:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:38:29,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:29,525 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 10:38:29,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:38:29,726 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1879150547, now seen corresponding path program 1 times [2019-12-07 10:38:29,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:29,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932936534] [2019-12-07 10:38:29,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:29,793 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:38:29,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:29,797 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 10:38:29,797 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:29,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:29,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:29,799 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:38:29,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:29,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-12-07 10:38:29,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:29,840 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 10:38:29,841 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:29,841 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 10:38:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:38:29,852 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:38:29,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932936534] [2019-12-07 10:38:29,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:29,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 10:38:29,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625849379] [2019-12-07 10:38:29,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:38:29,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:29,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:38:29,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:38:29,879 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 5 states. [2019-12-07 10:38:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:30,042 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-12-07 10:38:30,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:38:30,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 10:38:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:30,043 INFO L225 Difference]: With dead ends: 92 [2019-12-07 10:38:30,044 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 10:38:30,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 4 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 10:38:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 10:38:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2019-12-07 10:38:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 10:38:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-12-07 10:38:30,049 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 17 [2019-12-07 10:38:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:30,050 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-12-07 10:38:30,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:38:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-12-07 10:38:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 10:38:30,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:30,051 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 10:38:30,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 10:38:30,252 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1879150548, now seen corresponding path program 1 times [2019-12-07 10:38:30,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:30,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047657308] [2019-12-07 10:38:30,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:30,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 10:38:30,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:30,371 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 10:38:30,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,380 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 10:38:30,381 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,387 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:38:30,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:30,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 10:38:30,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,452 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 11 treesize of output 15 [2019-12-07 10:38:30,452 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,460 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:30,461 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 10:38:30,487 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 10:38:30,487 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:30,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:30,779 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 10:38:30,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047657308] [2019-12-07 10:38:30,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [698669322] [2019-12-07 10:38:30,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:38:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:30,886 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 10:38:30,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:30,892 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 10:38:30,892 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,899 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 10:38:30,899 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,905 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,905 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:38:30,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:30,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 10:38:30,913 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,930 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 11 treesize of output 15 [2019-12-07 10:38:30,931 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:30,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:30,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:30,938 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 10:38:30,958 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 10:38:30,958 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:30,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:31,065 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 10:38:31,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734683194] [2019-12-07 10:38:31,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:31,143 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 10:38:31,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:31,149 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 10:38:31,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:31,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:31,158 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 10:38:31,158 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:31,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:31,164 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:31,164 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:38:31,175 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:31,175 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 11 treesize of output 15 [2019-12-07 10:38:31,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:31,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:31,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 10:38:31,187 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:31,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:31,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:31,195 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 10:38:31,211 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 10:38:31,211 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:31,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:31,310 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 10:38:31,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:38:31,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2019-12-07 10:38:31,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264118371] [2019-12-07 10:38:31,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:38:31,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:31,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:38:31,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:38:31,312 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 10 states. [2019-12-07 10:38:31,882 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 10:38:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:36,797 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-12-07 10:38:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:38:36,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 10:38:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:36,799 INFO L225 Difference]: With dead ends: 111 [2019-12-07 10:38:36,799 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 10:38:36,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:38:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 10:38:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2019-12-07 10:38:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 10:38:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-12-07 10:38:36,802 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 17 [2019-12-07 10:38:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:36,803 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-12-07 10:38:36,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:38:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-12-07 10:38:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:38:36,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:36,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:37,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:37,406 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash -687020393, now seen corresponding path program 1 times [2019-12-07 10:38:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988919226] [2019-12-07 10:38:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:37,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:38:37,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:38:37,501 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:38:37,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988919226] [2019-12-07 10:38:37,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:37,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 10:38:37,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874990068] [2019-12-07 10:38:37,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:38:37,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:37,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:38:37,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:38:37,533 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2019-12-07 10:38:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:37,608 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-12-07 10:38:37,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:38:37,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 10:38:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:37,609 INFO L225 Difference]: With dead ends: 101 [2019-12-07 10:38:37,609 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 10:38:37,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:38:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 10:38:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2019-12-07 10:38:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 10:38:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-12-07 10:38:37,612 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 22 [2019-12-07 10:38:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:37,612 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-12-07 10:38:37,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:38:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-12-07 10:38:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:38:37,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:37,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:37,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 10:38:37,815 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:37,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:37,815 INFO L82 PathProgramCache]: Analyzing trace with hash -687020338, now seen corresponding path program 1 times [2019-12-07 10:38:37,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:37,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926537181] [2019-12-07 10:38:37,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/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 10:38:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:37,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:38:37,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:37,909 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 10:38:37,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:37,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:37,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:37,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:38:37,951 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 10:38:37,951 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:37,960 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 10:38:37,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926537181] [2019-12-07 10:38:37,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:37,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-07 10:38:37,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262412252] [2019-12-07 10:38:37,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:38:37,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:37,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:38:37,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:38:37,961 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2019-12-07 10:38:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:38,468 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2019-12-07 10:38:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:38:38,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 10:38:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:38,470 INFO L225 Difference]: With dead ends: 104 [2019-12-07 10:38:38,470 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 10:38:38,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:38:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 10:38:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 77. [2019-12-07 10:38:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 10:38:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-12-07 10:38:38,474 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 22 [2019-12-07 10:38:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:38,474 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-12-07 10:38:38,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:38:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-12-07 10:38:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:38:38,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:38,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:38,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 10:38:38,676 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -687020337, now seen corresponding path program 1 times [2019-12-07 10:38:38,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:38,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343873202] [2019-12-07 10:38:38,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 10:38:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:38,747 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 10:38:38,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:38,752 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 10:38:38,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:38,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:38,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:38,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:38:38,821 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 10:38:38,821 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:39,247 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 10:38:39,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343873202] [2019-12-07 10:38:39,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:38:39,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 10:38:39,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014895357] [2019-12-07 10:38:39,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:38:39,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:39,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:38:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:38:39,249 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 16 states. [2019-12-07 10:38:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:40,509 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-12-07 10:38:40,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:38:40,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 10:38:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:40,511 INFO L225 Difference]: With dead ends: 128 [2019-12-07 10:38:40,511 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 10:38:40,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:38:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 10:38:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2019-12-07 10:38:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 10:38:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-12-07 10:38:40,514 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 22 [2019-12-07 10:38:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:40,514 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-12-07 10:38:40,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:38:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-12-07 10:38:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:38:40,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:40,515 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:40,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 10:38:40,716 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:40,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1503677429, now seen corresponding path program 1 times [2019-12-07 10:38:40,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:40,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778219087] [2019-12-07 10:38:40,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 10:38:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:40,863 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 10:38:40,864 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:40,868 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 10:38:40,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:40,870 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:40,870 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:40,870 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:38:40,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:40,893 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 13 treesize of output 17 [2019-12-07 10:38:40,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:40,898 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:40,898 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:40,898 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 10:38:40,938 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 10:38:40,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:40,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:40,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:40,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 10:38:41,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:41,003 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 10:38:41,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:41,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:41,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:38:41,027 INFO L614 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-12-07 10:38:41,028 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 10:38:41,028 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 10:38:41,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:41,177 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 36 treesize of output 31 [2019-12-07 10:38:41,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:41,181 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 10:38:41,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:7 [2019-12-07 10:38:41,227 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 10:38:41,227 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:41,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:41,368 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 26 treesize of output 30 [2019-12-07 10:38:41,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:41,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:41,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:41,371 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2019-12-07 10:38:41,494 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,512 INFO L614 ElimStorePlain]: treesize reduction 10, result has 52.4 percent of original size [2019-12-07 10:38:41,513 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 10:38:41,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-12-07 10:38:41,586 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 10:38:41,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778219087] [2019-12-07 10:38:41,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [55227291] [2019-12-07 10:38:41,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:38:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:41,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 10:38:41,717 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:41,720 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 10:38:41,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:41,721 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,721 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:38:41,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:41,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-12-07 10:38:41,739 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,761 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 10:38:41,761 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 10:38:41,909 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 10:38:41,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:41,920 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:41,920 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-12-07 10:38:42,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:42,044 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2019-12-07 10:38:42,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:42,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:42,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:42,056 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 10:38:42,056 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:39 [2019-12-07 10:38:42,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:42,352 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 36 treesize of output 31 [2019-12-07 10:38:42,352 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:42,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:42,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:42,358 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-12-07 10:38:42,483 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 10:38:42,483 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:42,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:42,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:42,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:42,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:42,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 10:38:42,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:36 [2019-12-07 10:38:46,523 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 10:38:46,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084511783] [2019-12-07 10:38:46,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:38:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:46,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 10:38:46,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:46,574 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 10:38:46,574 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,576 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,576 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,576 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:38:46,584 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,584 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 13 treesize of output 17 [2019-12-07 10:38:46,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,589 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,589 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 10:38:46,593 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 10:38:46,593 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 10:38:46,620 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,620 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2019-12-07 10:38:46,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:46,621 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,630 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 10:38:46,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2019-12-07 10:38:46,643 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,643 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 36 treesize of output 31 [2019-12-07 10:38:46,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,649 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 10:38:46,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:7 [2019-12-07 10:38:46,651 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 10:38:46,651 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:46,685 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,685 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 26 treesize of output 30 [2019-12-07 10:38:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:46,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:46,688 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:46,689 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2019-12-07 10:38:46,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:46,709 INFO L614 ElimStorePlain]: treesize reduction 10, result has 52.4 percent of original size [2019-12-07 10:38:46,709 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 10:38:46,709 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-12-07 10:38:46,748 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 10:38:46,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:38:46,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 15, 15, 15, 11] total 42 [2019-12-07 10:38:46,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845697989] [2019-12-07 10:38:46,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 10:38:46,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:38:46,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 10:38:46,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1644, Unknown=1, NotChecked=0, Total=1806 [2019-12-07 10:38:46,750 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 43 states. [2019-12-07 10:38:48,250 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-12-07 10:38:48,683 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-12-07 10:38:49,005 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-12-07 10:38:49,434 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2019-12-07 10:38:49,845 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-12-07 10:38:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:38:52,410 INFO L93 Difference]: Finished difference Result 256 states and 279 transitions. [2019-12-07 10:38:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 10:38:52,411 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 25 [2019-12-07 10:38:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:38:52,413 INFO L225 Difference]: With dead ends: 256 [2019-12-07 10:38:52,413 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 10:38:52,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=742, Invalid=4087, Unknown=1, NotChecked=0, Total=4830 [2019-12-07 10:38:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 10:38:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 103. [2019-12-07 10:38:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-12-07 10:38:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-12-07 10:38:52,419 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 25 [2019-12-07 10:38:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:38:52,419 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-12-07 10:38:52,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 10:38:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-12-07 10:38:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:38:52,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:38:52,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:38:53,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:38:53,022 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:38:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:38:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1503677428, now seen corresponding path program 1 times [2019-12-07 10:38:53,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:38:53,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931751396] [2019-12-07 10:38:53,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 10:38:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:53,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 10:38:53,130 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:53,135 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 10:38:53,135 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,144 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 10:38:53,144 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,149 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,149 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:38:53,183 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,183 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 13 treesize of output 17 [2019-12-07 10:38:53,184 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,197 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 10:38:53,197 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,207 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,207 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2019-12-07 10:38:53,270 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 10:38:53,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,286 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 10:38:53,286 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,296 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 10:38:53,361 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 22 [2019-12-07 10:38:53,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,405 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 60 [2019-12-07 10:38:53,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:53,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:53,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:53,407 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 10:38:53,450 INFO L614 ElimStorePlain]: treesize reduction 48, result has 53.8 percent of original size [2019-12-07 10:38:53,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:53,451 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56 [2019-12-07 10:38:53,676 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,676 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 47 treesize of output 38 [2019-12-07 10:38:53,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,690 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 10:38:53,693 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:53,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:53,700 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:53,700 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:20 [2019-12-07 10:38:53,811 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 10:38:53,811 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:55,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:55,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:55,443 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:55,601 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 10:38:55,601 INFO L614 ElimStorePlain]: treesize reduction 50, result has 65.8 percent of original size [2019-12-07 10:38:55,607 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:55,725 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 10:38:55,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:55,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:55,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:55,728 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-12-07 10:38:55,728 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:127, output treesize:35 [2019-12-07 10:38:56,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:57,279 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 10:38:57,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931751396] [2019-12-07 10:38:57,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1865837056] [2019-12-07 10:38:57,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:38:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:38:57,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 10:38:57,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:38:57,443 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 10:38:57,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,449 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:57,451 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 10:38:57,451 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:57,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,456 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:38:57,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:38:57,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 10:38:57,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:57,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:57,484 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 13 treesize of output 17 [2019-12-07 10:38:57,485 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,495 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:57,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,495 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:26 [2019-12-07 10:38:57,755 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 10:38:57,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:57,773 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 10:38:57,773 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:57,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:38:57,784 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 10:38:58,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:58,007 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 62 [2019-12-07 10:38:58,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:38:58,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:58,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:58,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:38:58,059 INFO L614 ElimStorePlain]: treesize reduction 56, result has 54.5 percent of original size [2019-12-07 10:38:58,062 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 22 [2019-12-07 10:38:58,062 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:58,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:58,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:58,077 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:59 [2019-12-07 10:38:58,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:58,641 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 49 treesize of output 40 [2019-12-07 10:38:58,641 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:58,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:58,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 10:38:58,657 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:58,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:58,664 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:38:58,664 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:20 [2019-12-07 10:38:58,714 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 10:38:58,714 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:38:59,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:59,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:59,217 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:59,388 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-07 10:38:59,388 INFO L614 ElimStorePlain]: treesize reduction 50, result has 65.8 percent of original size [2019-12-07 10:38:59,394 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:38:59,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:38:59,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:59,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:38:59,488 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 10:38:59,488 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:127, output treesize:47 [2019-12-07 10:38:59,907 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-12-07 10:39:00,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:01,782 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 10:39:01,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037346397] [2019-12-07 10:39:01,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:39:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:01,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 10:39:01,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:01,837 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 10:39:01,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,842 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,844 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 10:39:01,844 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,850 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:39:01,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:39:01,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 10:39:01,856 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,872 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,873 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 13 treesize of output 17 [2019-12-07 10:39:01,873 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,882 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,882 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2019-12-07 10:39:01,887 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 10:39:01,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,903 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 10:39:01,903 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,914 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,914 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,914 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 10:39:01,937 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,937 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 62 [2019-12-07 10:39:01,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:01,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,958 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 22 [2019-12-07 10:39:01,958 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:01,972 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,972 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:39:01,972 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:56 [2019-12-07 10:39:01,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:01,988 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 47 treesize of output 38 [2019-12-07 10:39:01,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:02,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:02,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 10:39:02,004 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:02,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:02,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:39:02,012 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:20 [2019-12-07 10:39:02,061 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 10:39:02,061 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:02,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:02,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:02,572 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:02,748 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 10:39:02,748 INFO L614 ElimStorePlain]: treesize reduction 50, result has 65.8 percent of original size [2019-12-07 10:39:02,754 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:02,875 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 10:39:02,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:02,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:02,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:02,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:02,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:02,879 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2019-12-07 10:39:02,879 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:127, output treesize:62 [2019-12-07 10:39:03,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:39:03,437 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 10:39:03,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:39:03,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 44 [2019-12-07 10:39:03,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987374747] [2019-12-07 10:39:03,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-07 10:39:03,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:39:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-07 10:39:03,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1830, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 10:39:03,439 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 45 states. [2019-12-07 10:39:05,577 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-12-07 10:39:05,948 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-12-07 10:39:06,286 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-12-07 10:39:06,690 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 98 [2019-12-07 10:39:07,114 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-07 10:39:07,590 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 120 [2019-12-07 10:39:08,430 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 143 [2019-12-07 10:39:08,786 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-07 10:39:09,464 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 149 [2019-12-07 10:39:16,537 WARN L192 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-07 10:39:17,079 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 125 [2019-12-07 10:39:18,677 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 10:39:23,379 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-12-07 10:39:24,984 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 10:39:25,742 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 10:39:26,590 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 10:39:27,137 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-12-07 10:39:28,238 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 10:39:29,717 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 10:39:31,261 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-07 10:39:34,767 WARN L192 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-12-07 10:39:36,384 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 10:39:45,990 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 10:39:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:39:46,442 INFO L93 Difference]: Finished difference Result 364 states and 389 transitions. [2019-12-07 10:39:46,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 10:39:46,443 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 25 [2019-12-07 10:39:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:39:46,444 INFO L225 Difference]: With dead ends: 364 [2019-12-07 10:39:46,444 INFO L226 Difference]: Without dead ends: 364 [2019-12-07 10:39:46,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=912, Invalid=4940, Unknown=0, NotChecked=0, Total=5852 [2019-12-07 10:39:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-12-07 10:39:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 109. [2019-12-07 10:39:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 10:39:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-12-07 10:39:46,449 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 25 [2019-12-07 10:39:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:39:46,449 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-12-07 10:39:46,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-07 10:39:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-12-07 10:39:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:39:46,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:39:46,450 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:39:47,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:39:47,052 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:39:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:39:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash 456294935, now seen corresponding path program 2 times [2019-12-07 10:39:47,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:39:47,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647348873] [2019-12-07 10:39:47,054 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 10:39:47,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:39:47,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:39:47,135 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:39:47,136 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:39:47,151 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:39:47,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647348873] [2019-12-07 10:39:47,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [430266242] [2019-12-07 10:39:47,215 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:39:47,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:39:47,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:39:47,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:39:47,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:39:47,345 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:39:47,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631576935] [2019-12-07 10:39:47,348 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:39:47,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:39:47,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:39:47,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:39:47,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:39:47,473 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 10:39:47,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:39:47,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 10:39:47,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969848771] [2019-12-07 10:39:47,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:39:47,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:39:47,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:39:47,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:39:47,719 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 16 states. [2019-12-07 10:39:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:39:48,827 INFO L93 Difference]: Finished difference Result 446 states and 486 transitions. [2019-12-07 10:39:48,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:39:48,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-12-07 10:39:48,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:39:48,829 INFO L225 Difference]: With dead ends: 446 [2019-12-07 10:39:48,830 INFO L226 Difference]: Without dead ends: 446 [2019-12-07 10:39:48,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 10:39:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-12-07 10:39:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 123. [2019-12-07 10:39:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 10:39:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2019-12-07 10:39:48,834 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 28 [2019-12-07 10:39:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:39:48,834 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2019-12-07 10:39:48,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:39:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2019-12-07 10:39:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:39:48,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:39:48,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:39:49,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:39:49,437 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:39:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:39:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1407458907, now seen corresponding path program 1 times [2019-12-07 10:39:49,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:39:49,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847763215] [2019-12-07 10:39:49,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 10:39:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:49,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:39:49,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:49,534 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:49,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847763215] [2019-12-07 10:39:49,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [72135025] [2019-12-07 10:39:49,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:39:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:49,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:39:49,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:49,700 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:49,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807846548] [2019-12-07 10:39:49,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:39:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:49,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 10:39:49,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:49,828 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:49,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 10:39:49,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [5, 5, 5, 5] total 15 [2019-12-07 10:39:49,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384443378] [2019-12-07 10:39:49,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:39:49,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:39:49,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:39:49,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:39:49,841 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 9 states. [2019-12-07 10:39:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:39:50,384 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2019-12-07 10:39:50,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:39:50,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-12-07 10:39:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:39:50,385 INFO L225 Difference]: With dead ends: 148 [2019-12-07 10:39:50,385 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 10:39:50,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:39:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 10:39:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2019-12-07 10:39:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 10:39:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2019-12-07 10:39:50,389 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 31 [2019-12-07 10:39:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:39:50,389 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2019-12-07 10:39:50,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:39:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2019-12-07 10:39:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:39:50,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:39:50,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:39:50,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3,24 cvc4 --incremental --print-success --lang smt --rewrite-divk,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:39:50,991 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:39:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:39:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1407458906, now seen corresponding path program 1 times [2019-12-07 10:39:50,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:39:50,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181751027] [2019-12-07 10:39:50,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 10:39:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:51,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:39:51,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:51,080 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:51,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181751027] [2019-12-07 10:39:51,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [398712715] [2019-12-07 10:39:51,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:39:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:51,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:39:51,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:51,251 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:51,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535711669] [2019-12-07 10:39:51,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:39:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:51,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 10:39:51,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:51,312 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:51,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:39:51,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2019-12-07 10:39:51,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563442388] [2019-12-07 10:39:51,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:39:51,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:39:51,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:39:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:39:51,360 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 10 states. [2019-12-07 10:39:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:39:51,462 INFO L93 Difference]: Finished difference Result 195 states and 227 transitions. [2019-12-07 10:39:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:39:51,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-12-07 10:39:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:39:51,463 INFO L225 Difference]: With dead ends: 195 [2019-12-07 10:39:51,464 INFO L226 Difference]: Without dead ends: 195 [2019-12-07 10:39:51,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:39:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-07 10:39:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 169. [2019-12-07 10:39:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-07 10:39:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 224 transitions. [2019-12-07 10:39:51,467 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 224 transitions. Word has length 31 [2019-12-07 10:39:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:39:51,467 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 224 transitions. [2019-12-07 10:39:51,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:39:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 224 transitions. [2019-12-07 10:39:51,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:39:51,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:39:51,468 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:39:52,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 cvc4 --incremental --print-success --lang smt --rewrite-divk,26 mathsat -unsat_core_generation=3 [2019-12-07 10:39:52,069 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:39:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:39:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash -640737917, now seen corresponding path program 1 times [2019-12-07 10:39:52,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:39:52,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233981686] [2019-12-07 10:39:52,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 10:39:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:52,183 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:39:52,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:52,199 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:52,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233981686] [2019-12-07 10:39:52,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [591689716] [2019-12-07 10:39:52,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:39:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:52,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:39:52,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:52,388 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:52,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339661940] [2019-12-07 10:39:52,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:39:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:52,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:39:52,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:52,448 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:39:52,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:39:52,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 10:39:52,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301967115] [2019-12-07 10:39:52,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:39:52,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:39:52,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:39:52,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:39:52,646 INFO L87 Difference]: Start difference. First operand 169 states and 224 transitions. Second operand 16 states. [2019-12-07 10:39:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:39:52,808 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2019-12-07 10:39:52,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:39:52,809 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-12-07 10:39:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:39:52,809 INFO L225 Difference]: With dead ends: 154 [2019-12-07 10:39:52,809 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 10:39:52,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:39:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 10:39:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2019-12-07 10:39:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 10:39:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 187 transitions. [2019-12-07 10:39:52,812 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 187 transitions. Word has length 32 [2019-12-07 10:39:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:39:52,813 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 187 transitions. [2019-12-07 10:39:52,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:39:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 187 transitions. [2019-12-07 10:39:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:39:52,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:39:52,814 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:39:53,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk,29 mathsat -unsat_core_generation=3,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:39:53,416 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:39:53,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:39:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1587969722, now seen corresponding path program 2 times [2019-12-07 10:39:53,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:39:53,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268684190] [2019-12-07 10:39:53,418 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 10:39:53,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 10:39:53,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:39:53,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 10:39:53,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:39:53,519 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 10:39:53,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268684190] [2019-12-07 10:39:53,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:39:53,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 10:39:53,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709452743] [2019-12-07 10:39:53,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:39:53,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:39:53,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:39:53,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:39:53,561 INFO L87 Difference]: Start difference. First operand 148 states and 187 transitions. Second operand 8 states. [2019-12-07 10:39:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:39:53,650 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2019-12-07 10:39:53,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:39:53,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 10:39:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:39:53,651 INFO L225 Difference]: With dead ends: 155 [2019-12-07 10:39:53,651 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 10:39:53,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:39:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 10:39:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2019-12-07 10:39:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 10:39:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 184 transitions. [2019-12-07 10:39:53,654 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 184 transitions. Word has length 35 [2019-12-07 10:39:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:39:53,654 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 184 transitions. [2019-12-07 10:39:53,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:39:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 184 transitions. [2019-12-07 10:39:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:39:53,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:39:53,655 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:39:53,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 10:39:53,856 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:39:53,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:39:53,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1587969777, now seen corresponding path program 1 times [2019-12-07 10:39:53,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:39:53,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778674008] [2019-12-07 10:39:53,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 10:39:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:53,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 10:39:53,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:53,991 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 10:39:53,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:53,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:53,995 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:39:53,995 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 10:39:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:39:54,063 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:39:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:39:54,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778674008] [2019-12-07 10:39:54,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:39:54,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 10:39:54,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958629876] [2019-12-07 10:39:54,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:39:54,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:39:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:39:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:39:54,548 INFO L87 Difference]: Start difference. First operand 147 states and 184 transitions. Second operand 16 states. [2019-12-07 10:39:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:39:55,727 INFO L93 Difference]: Finished difference Result 194 states and 229 transitions. [2019-12-07 10:39:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:39:55,728 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-12-07 10:39:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:39:55,729 INFO L225 Difference]: With dead ends: 194 [2019-12-07 10:39:55,729 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 10:39:55,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-12-07 10:39:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 10:39:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 147. [2019-12-07 10:39:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 10:39:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 177 transitions. [2019-12-07 10:39:55,732 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 177 transitions. Word has length 35 [2019-12-07 10:39:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:39:55,732 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 177 transitions. [2019-12-07 10:39:55,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:39:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 177 transitions. [2019-12-07 10:39:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 10:39:55,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:39:55,732 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:39:55,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 10:39:55,933 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:39:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:39:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1857088373, now seen corresponding path program 1 times [2019-12-07 10:39:55,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:39:55,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929398680] [2019-12-07 10:39:55,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 10:39:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:56,099 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 10:39:56,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:39:56,102 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 10:39:56,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:56,106 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:56,106 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:39:56,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:39:56,125 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:56,126 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 13 treesize of output 17 [2019-12-07 10:39:56,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:56,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:56,132 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:39:56,132 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2019-12-07 10:39:56,173 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 10:39:56,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:56,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:56,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:39:56,179 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 10:39:56,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:56,239 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 53 [2019-12-07 10:39:56,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:56,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:39:56,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:56,248 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 10:39:56,248 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-12-07 10:39:56,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:39:56,616 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 62 treesize of output 119 [2019-12-07 10:39:56,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:39:56,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:08,781 WARN L192 SmtUtils]: Spent 12.16 s on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 10:40:08,781 INFO L614 ElimStorePlain]: treesize reduction 32, result has 67.3 percent of original size [2019-12-07 10:40:08,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:08,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:08,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:08,782 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 10:40:08,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:21 [2019-12-07 10:40:08,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:40:08,859 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 39 treesize of output 19 [2019-12-07 10:40:08,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:08,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:08,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:08,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:21 [2019-12-07 10:40:08,930 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 25 treesize of output 13 [2019-12-07 10:40:08,930 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:08,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:08,934 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 10:40:08,934 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:7 [2019-12-07 10:40:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:40:08,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:40:09,092 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 10:40:09,095 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:09,096 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 10:40:09,096 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2019-12-07 10:40:09,424 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 10:40:09,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:09,428 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 10:40:09,428 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-12-07 10:40:14,433 WARN L192 SmtUtils]: Spent 955.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 10:40:16,609 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 10:40:18,131 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:18,131 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 66 treesize of output 70 [2019-12-07 10:40:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:18,132 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:18,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:18,136 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:40:18,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:57 [2019-12-07 10:40:21,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:21,949 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2019-12-07 10:40:21,950 INFO L614 ElimStorePlain]: treesize reduction 220, result has 16.7 percent of original size [2019-12-07 10:40:21,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:21,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:21,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:40:21,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:21,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:40:21,951 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:121, output treesize:8 [2019-12-07 10:40:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:40:22,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929398680] [2019-12-07 10:40:22,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1744683051] [2019-12-07 10:40:22,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:40:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:22,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 10:40:22,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:40:22,397 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 10:40:22,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:22,398 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:22,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:22,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:40:22,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:22,405 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 13 treesize of output 17 [2019-12-07 10:40:22,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:22,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:22,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:22,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2019-12-07 10:40:22,413 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 10:40:22,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:22,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:22,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:22,420 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 10:40:22,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:22,441 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 10:40:22,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:40:22,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:22,442 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:40:22,467 INFO L614 ElimStorePlain]: treesize reduction 35, result has 47.8 percent of original size [2019-12-07 10:40:22,467 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 10:40:22,467 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-12-07 10:40:22,555 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:22,555 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 62 treesize of output 119 [2019-12-07 10:40:22,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:22,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:34,808 WARN L192 SmtUtils]: Spent 12.25 s on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 10:40:34,808 INFO L614 ElimStorePlain]: treesize reduction 32, result has 67.3 percent of original size [2019-12-07 10:40:34,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:34,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:34,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:34,809 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 10:40:34,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:21 [2019-12-07 10:40:34,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:40:34,813 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 39 treesize of output 19 [2019-12-07 10:40:34,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:34,819 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:34,819 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:34,819 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:21 [2019-12-07 10:40:34,846 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 25 treesize of output 13 [2019-12-07 10:40:34,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:34,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:34,850 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 10:40:34,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:7 [2019-12-07 10:40:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:40:34,856 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:40:34,886 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 10:40:34,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:34,890 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 10:40:34,890 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2019-12-07 10:40:37,231 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 10:40:37,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:37,235 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 10:40:37,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-12-07 10:40:38,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:38,368 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 66 treesize of output 70 [2019-12-07 10:40:38,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:38,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:38,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:38,373 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:40:38,373 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:57 [2019-12-07 10:40:38,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:38,665 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2019-12-07 10:40:38,665 INFO L614 ElimStorePlain]: treesize reduction 220, result has 16.7 percent of original size [2019-12-07 10:40:38,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:38,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:38,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:40:38,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:38,666 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:40:38,667 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:121, output treesize:8 [2019-12-07 10:40:38,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:40:38,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016768184] [2019-12-07 10:40:38,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:40:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:38,795 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 10:40:38,796 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:40:38,798 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 10:40:38,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:38,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:38,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:38,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 10:40:38,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:38,807 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 13 treesize of output 17 [2019-12-07 10:40:38,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:38,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:38,811 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:38,811 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 10:40:38,852 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 10:40:38,852 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:38,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:38,857 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:38,857 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 10:40:42,998 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:42,999 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-12-07 10:40:42,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:40:42,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:43,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 10:40:43,021 INFO L614 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-12-07 10:40:43,021 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 10:40:43,021 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 10:40:46,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:46,208 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 62 treesize of output 119 [2019-12-07 10:40:46,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:40:46,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:40:46,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:40:46,218 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 6 xjuncts. [2019-12-07 10:40:54,484 WARN L192 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-12-07 10:40:54,484 INFO L614 ElimStorePlain]: treesize reduction 456, result has 14.9 percent of original size [2019-12-07 10:40:54,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 10:40:54,485 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:48 [2019-12-07 10:40:57,173 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-12-07 10:40:57,174 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 37 treesize of output 17 [2019-12-07 10:40:57,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:40:57,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:40:57,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:40:57,179 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2019-12-07 10:41:02,732 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 25 treesize of output 13 [2019-12-07 10:41:02,732 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:02,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:02,737 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 10:41:02,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2019-12-07 10:41:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:41:02,743 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:41:02,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 10:41:02,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:02,803 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 10:41:02,803 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2019-12-07 10:41:04,484 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 10:41:04,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:04,488 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 10:41:04,488 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:21 [2019-12-07 10:41:05,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:05,887 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 66 treesize of output 70 [2019-12-07 10:41:05,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:05,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:05,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:05,893 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 10:41:05,893 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:57 [2019-12-07 10:41:05,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:06,206 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 24 [2019-12-07 10:41:06,206 INFO L614 ElimStorePlain]: treesize reduction 220, result has 16.7 percent of original size [2019-12-07 10:41:06,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:06,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:06,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:41:06,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:06,208 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 10:41:06,208 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:121, output treesize:8 [2019-12-07 10:41:06,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:41:06,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 10:41:06,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20, 20, 20, 20] total 46 [2019-12-07 10:41:06,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729884974] [2019-12-07 10:41:06,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-07 10:41:06,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 10:41:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-07 10:41:06,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1971, Unknown=4, NotChecked=0, Total=2162 [2019-12-07 10:41:06,289 INFO L87 Difference]: Start difference. First operand 147 states and 177 transitions. Second operand 47 states. [2019-12-07 10:41:08,616 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-07 10:41:08,892 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-12-07 10:41:09,171 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-12-07 10:41:09,487 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-12-07 10:41:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:41:14,143 INFO L93 Difference]: Finished difference Result 332 states and 404 transitions. [2019-12-07 10:41:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 10:41:14,144 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 38 [2019-12-07 10:41:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:41:14,145 INFO L225 Difference]: With dead ends: 332 [2019-12-07 10:41:14,145 INFO L226 Difference]: Without dead ends: 332 [2019-12-07 10:41:14,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 155 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=554, Invalid=3998, Unknown=4, NotChecked=0, Total=4556 [2019-12-07 10:41:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-07 10:41:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 235. [2019-12-07 10:41:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 10:41:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 308 transitions. [2019-12-07 10:41:14,151 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 308 transitions. Word has length 38 [2019-12-07 10:41:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:41:14,151 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 308 transitions. [2019-12-07 10:41:14,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-07 10:41:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 308 transitions. [2019-12-07 10:41:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 10:41:14,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:41:14,151 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:41:14,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk,34 mathsat -unsat_core_generation=3,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:41:14,753 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-12-07 10:41:14,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:41:14,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1857088372, now seen corresponding path program 1 times [2019-12-07 10:41:14,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 10:41:14,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981810321] [2019-12-07 10:41:14,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 10:41:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:41:14,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 10:41:14,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:41:14,932 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 10:41:14,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:14,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:14,939 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 10:41:14,940 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:14,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:14,945 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:41:14,945 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 10:41:14,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:41:14,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2019-12-07 10:41:14,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:14,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:15,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:15,007 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 13 treesize of output 17 [2019-12-07 10:41:15,007 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:15,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:15,018 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:41:15,018 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:26 [2019-12-07 10:41:15,087 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 10:41:15,087 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:15,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:15,106 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 10:41:15,107 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:15,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:15,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:41:15,119 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 10:41:15,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:15,219 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 64 [2019-12-07 10:41:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:15,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:15,239 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:15,242 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 22 [2019-12-07 10:41:15,243 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:15,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:15,258 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:41:15,258 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:59 [2019-12-07 10:41:21,724 WARN L192 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 10:41:21,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:21,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 59 [2019-12-07 10:41:21,725 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:27,861 WARN L192 SmtUtils]: Spent 6.14 s on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 10:41:27,861 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:27,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:27,943 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 105 treesize of output 150 [2019-12-07 10:41:27,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:27,944 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:52,446 WARN L192 SmtUtils]: Spent 24.50 s on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 10:41:52,446 INFO L614 ElimStorePlain]: treesize reduction 32, result has 79.4 percent of original size [2019-12-07 10:41:52,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:52,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:52,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:52,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:52,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:52,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:52,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:52,449 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 10:41:52,449 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:33 [2019-12-07 10:41:52,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:41:52,577 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 10:41:52,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:52,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:52,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 10:41:52,603 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 37 treesize of output 17 [2019-12-07 10:41:52,603 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:52,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:52,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:41:52,612 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:35 [2019-12-07 10:41:52,678 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 27 treesize of output 15 [2019-12-07 10:41:52,679 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:52,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:52,690 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 10:41:52,690 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:52,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:52,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:41:52,697 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:18 [2019-12-07 10:41:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 10:41:52,815 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:41:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:53,378 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 10:41:53,383 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:41:53,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:53,465 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:53,469 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 10:41:53,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:53,513 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 10:41:53,513 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:71 [2019-12-07 10:41:54,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:41:54,044 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 10:41:54,048 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 10:41:54,108 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:54,112 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 10:41:54,117 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 10:41:54,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:41:54,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-12-07 10:41:54,149 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:71 [2019-12-07 10:41:58,302 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 10:42:02,159 WARN L192 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 10:42:02,923 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 10:42:08,979 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 10:42:10,995 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_16 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (ULTIMATE.start_sll_circular_create_~last~0.offset (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) (.cse2 (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) ULTIMATE.start_sll_circular_create_~last~0.offset c_ULTIMATE.start_sll_circular_create_~new_head~0.base)) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd v_prenex_16 (_ bv4 32)) v_DerPreprocessor_12))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_DerPreprocessor_13 (_ BitVec 32)) (v_prenex_17 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_subst_18 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_17 c_ULTIMATE.start_sll_circular_create_~new_head~0.base)))) (let ((.cse4 (select (select .cse6 c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)) (.cse5 (bvadd v_subst_18 (_ bv4 32)))) (bvule (bvadd (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sll_circular_create_~last~0.base) v_prenex_17 c_ULTIMATE.start_sll_circular_create_~new_head~0.offset)))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_DerPreprocessor_11))) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset) (_ bv8 32)) (select |c_#length| (select (select (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 v_DerPreprocessor_13)) c_ULTIMATE.start_sll_circular_create_~new_head~0.base) c_ULTIMATE.start_sll_circular_create_~new_head~0.offset))))))) is different from false [2019-12-07 10:42:11,010 INFO L430 ElimStorePlain]: Different costs {2=[v_prenex_18], 3=[|#memory_$Pointer$.offset|, v_prenex_19], 5=[|#memory_$Pointer$.base|]} [2019-12-07 10:42:11,040 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:11,539 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-07 10:42:11,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:11,558 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 10:42:14,080 WARN L192 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-12-07 10:42:14,080 INFO L614 ElimStorePlain]: treesize reduction 835, result has 45.4 percent of original size [2019-12-07 10:42:14,138 INFO L343 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2019-12-07 10:42:14,138 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 285 treesize of output 263 [2019-12-07 10:42:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:42:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:14,205 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:42:14,205 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2019-12-07 10:42:14,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:14,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:14,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:42:14,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:42:14,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:42:14,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:42:14,225 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_97], 1=[v_arrayElimCell_98]} [2019-12-07 10:42:14,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981810321] [2019-12-07 10:42:14,237 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4c89ed5c [2019-12-07 10:42:14,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1601216767] [2019-12-07 10:42:14,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:42:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:14,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 10:42:14,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:14,497 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4c89ed5c [2019-12-07 10:42:14,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384048925] [2019-12-07 10:42:14,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b1404940-c971-492f-9c88-aa57dffb1328/bin/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:42:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:42:14,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 10:42:14,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:42:14,568 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4c89ed5c [2019-12-07 10:42:14,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:42:14,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 10:42:14,569 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 10:42:14,569 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:42:15,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:42:15,188 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 10:42:15,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:42:15 BoogieIcfgContainer [2019-12-07 10:42:15,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:42:15,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:42:15,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:42:15,189 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:42:15,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:38:27" (3/4) ... [2019-12-07 10:42:15,192 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:42:15,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:42:15,193 INFO L168 Benchmark]: Toolchain (without parser) took 228876.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -215.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:15,193 INFO L168 Benchmark]: CDTParser took 0.14 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 10:42:15,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:15,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.13 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 10:42:15,194 INFO L168 Benchmark]: Boogie Preprocessor took 25.44 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 10:42:15,194 INFO L168 Benchmark]: RCFGBuilder took 392.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:15,194 INFO L168 Benchmark]: TraceAbstraction took 228097.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:15,195 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:42:15,196 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.44 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 392.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 228097.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.2 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 600]: 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: [L610] const int len = 2; [L611] const int data = 1; [L564] SLL temp = (SLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == temp) [L568] temp->next = ((void *)0) [L569] temp->data = data [L570] return temp; [L573] SLL head = node_create(data); [L574] SLL last = head; [L575] COND TRUE len > 1 [L564] SLL temp = (SLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == temp) [L568] temp->next = ((void *)0) [L569] temp->data = data [L570] return temp; [L576] SLL new_head = node_create(data); [L577] new_head->next = head [L578] head = new_head [L579] len-- [L575] COND FALSE !(len > 1) [L581] last->next = head [L582] return head; [L612] SLL s = sll_circular_create(len, data); [L613] int i = 0; [L614] i = len - 1 [L614] COND TRUE i > -1 [L615] int new_data = i + len; [L603] COND TRUE index > 0 [L604] EXPR head->next [L604] head = head->next [L605] index-- [L603] COND FALSE !(index > 0) [L607] head->data = data [L614] i-- [L614] COND TRUE i > -1 [L615] int new_data = i + len; [L603] COND FALSE !(index > 0) [L607] head->data = data [L614] i-- [L614] COND FALSE !(i > -1) [L618] i = len - 1 [L618] COND TRUE i > -1 [L619] int expected = i + len; [L596] COND TRUE index > 0 [L597] EXPR head->next [L597] head = head->next [L598] index-- [L596] COND FALSE !(index > 0) [L600] head->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 86 locations, 32 error locations. Result: UNKNOWN, OverallTime: 228.0s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 68.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1074 SDtfs, 11363 SDslu, 5280 SDs, 0 SdLazy, 5300 SolverSat, 671 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 35.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1869 GetRequests, 1391 SyntacticMatches, 56 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4473 ImplicationChecksByTransitivity, 81.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=19, 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, 19 MinimizatonAttempts, 1161 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 89.0s InterpolantComputationTime, 879 NumberOfCodeBlocks, 860 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1688 ConstructedInterpolants, 194 QuantifiedInterpolants, 490482 SizeOfPredicates, 448 NumberOfNonLiveVariables, 4052 ConjunctsInSsa, 511 ConjunctsInUnsatCore, 70 InterpolantComputations, 24 PerfectInterpolantSequences, 151/272 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...