./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.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_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 abd6dbc145d5f477746656086724ee83e0738836 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 abd6dbc145d5f477746656086724ee83e0738836 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:34:51,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:34:51,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:34:51,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:34:51,725 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:34:51,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:34:51,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:34:51,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:34:51,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:34:51,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:34:51,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:34:51,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:34:51,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:34:51,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:34:51,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:34:51,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:34:51,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:34:51,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:34:51,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:34:51,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:34:51,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:34:51,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:34:51,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:34:51,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:34:51,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:34:51,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:34:51,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:34:51,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:34:51,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:34:51,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:34:51,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:34:51,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:34:51,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:34:51,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:34:51,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:34:51,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:34:51,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:34:51,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:34:51,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:34:51,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:34:51,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:34:51,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 19:34:51,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:34:51,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:34:51,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:34:51,758 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:34:51,759 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:34:51,759 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:34:51,759 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:34:51,759 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:34:51,759 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:34:51,759 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:34:51,759 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:34:51,759 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:34:51,760 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:34:51,760 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:34:51,760 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:34:51,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:34:51,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:34:51,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:34:51,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:34:51,761 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:34:51,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:34:51,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:34:51,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:34:51,761 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:34:51,761 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:34:51,761 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:34:51,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:34:51,762 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:34:51,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:34:51,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:34:51,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:34:51,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:34:51,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:34:51,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:34:51,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:34:51,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:34:51,763 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:34:51,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:34:51,763 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:34:51,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:34:51,763 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_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 -> abd6dbc145d5f477746656086724ee83e0738836 [2019-12-07 19:34:51,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:34:51,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:34:51,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:34:51,873 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:34:51,874 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:34:51,874 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-12-07 19:34:51,912 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data/18f9e7357/f721f52fcfe94389b9ad3ffc5b0cffc5/FLAG065b986d8 [2019-12-07 19:34:52,303 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:34:52,303 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-12-07 19:34:52,313 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data/18f9e7357/f721f52fcfe94389b9ad3ffc5b0cffc5/FLAG065b986d8 [2019-12-07 19:34:52,321 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data/18f9e7357/f721f52fcfe94389b9ad3ffc5b0cffc5 [2019-12-07 19:34:52,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:34:52,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:34:52,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:34:52,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:34:52,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:34:52,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbb5b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52, skipping insertion in model container [2019-12-07 19:34:52,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:34:52,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:34:52,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:34:52,612 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:34:52,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:34:52,683 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:34:52,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52 WrapperNode [2019-12-07 19:34:52,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:34:52,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:34:52,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:34:52,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:34:52,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:34:52,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:34:52,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:34:52,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:34:52,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... [2019-12-07 19:34:52,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:34:52,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:34:52,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:34:52,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:34:52,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:34:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 19:34:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:34:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:34:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:34:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:34:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:34:52,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:34:52,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:34:53,134 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:34:53,134 INFO L287 CfgBuilder]: Removed 26 assume(true) statements. [2019-12-07 19:34:53,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:53 BoogieIcfgContainer [2019-12-07 19:34:53,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:34:53,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:34:53,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:34:53,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:34:53,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:34:52" (1/3) ... [2019-12-07 19:34:53,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271411b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:34:53, skipping insertion in model container [2019-12-07 19:34:53,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:52" (2/3) ... [2019-12-07 19:34:53,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271411b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:34:53, skipping insertion in model container [2019-12-07 19:34:53,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:53" (3/3) ... [2019-12-07 19:34:53,140 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2019-12-07 19:34:53,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:34:53,151 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-12-07 19:34:53,158 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-12-07 19:34:53,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:34:53,171 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:34:53,171 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:34:53,171 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:34:53,171 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:34:53,171 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:34:53,171 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:34:53,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:34:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-12-07 19:34:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:34:53,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:34:53,188 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 19:34:53,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash 211679, now seen corresponding path program 1 times [2019-12-07 19:34:53,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338213041] [2019-12-07 19:34:53,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:53,297 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 19:34:53,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338213041] [2019-12-07 19:34:53,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:53,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:34:53,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355640817] [2019-12-07 19:34:53,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:53,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:53,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:53,313 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 3 states. [2019-12-07 19:34:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:53,383 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-12-07 19:34:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:53,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:34:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:53,391 INFO L225 Difference]: With dead ends: 83 [2019-12-07 19:34:53,391 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 19:34:53,392 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 19:34:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 19:34:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2019-12-07 19:34:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 19:34:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-12-07 19:34:53,419 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 3 [2019-12-07 19:34:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:53,419 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-12-07 19:34:53,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-12-07 19:34:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:34:53,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:34:53,420 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 19:34:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 211680, now seen corresponding path program 1 times [2019-12-07 19:34:53,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188899635] [2019-12-07 19:34:53,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:53,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188899635] [2019-12-07 19:34:53,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:53,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:34:53,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208775849] [2019-12-07 19:34:53,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:53,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:53,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:53,460 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 3 states. [2019-12-07 19:34:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:53,496 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-12-07 19:34:53,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:53,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:34:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:53,497 INFO L225 Difference]: With dead ends: 56 [2019-12-07 19:34:53,497 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 19:34:53,498 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 19:34:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 19:34:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 19:34:53,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 19:34:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-12-07 19:34:53,504 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 3 [2019-12-07 19:34:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:53,504 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-12-07 19:34:53,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-12-07 19:34:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:34:53,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:34:53,505 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 19:34:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2011326641, now seen corresponding path program 1 times [2019-12-07 19:34:53,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775250415] [2019-12-07 19:34:53,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:53,535 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 19:34:53,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775250415] [2019-12-07 19:34:53,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:53,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:34:53,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874915033] [2019-12-07 19:34:53,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:53,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:53,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:53,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:53,536 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 3 states. [2019-12-07 19:34:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:53,545 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-12-07 19:34:53,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:53,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 19:34:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:53,546 INFO L225 Difference]: With dead ends: 57 [2019-12-07 19:34:53,546 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 19:34:53,546 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 19:34:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 19:34:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-12-07 19:34:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 19:34:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-12-07 19:34:53,550 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 6 [2019-12-07 19:34:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:53,550 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-12-07 19:34:53,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-12-07 19:34:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:34:53,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:53,551 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 19:34:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,551 INFO L82 PathProgramCache]: Analyzing trace with hash 181996205, now seen corresponding path program 1 times [2019-12-07 19:34:53,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832056307] [2019-12-07 19:34:53,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:53,593 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 19:34:53,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832056307] [2019-12-07 19:34:53,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:53,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:53,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593048929] [2019-12-07 19:34:53,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:53,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:53,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:53,595 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 4 states. [2019-12-07 19:34:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:53,658 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-12-07 19:34:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:53,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 19:34:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:53,659 INFO L225 Difference]: With dead ends: 78 [2019-12-07 19:34:53,659 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 19:34:53,660 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 19:34:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 19:34:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2019-12-07 19:34:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 19:34:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-12-07 19:34:53,664 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 9 [2019-12-07 19:34:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:53,664 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-12-07 19:34:53,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-12-07 19:34:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:34:53,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:53,665 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 19:34:53,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,666 INFO L82 PathProgramCache]: Analyzing trace with hash 181996206, now seen corresponding path program 1 times [2019-12-07 19:34:53,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485947733] [2019-12-07 19:34:53,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:53,709 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 19:34:53,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485947733] [2019-12-07 19:34:53,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:53,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:53,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33496176] [2019-12-07 19:34:53,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:53,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:53,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:53,711 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 4 states. [2019-12-07 19:34:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:53,757 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-12-07 19:34:53,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:53,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 19:34:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:53,758 INFO L225 Difference]: With dead ends: 58 [2019-12-07 19:34:53,758 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 19:34:53,758 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 19:34:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 19:34:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2019-12-07 19:34:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 19:34:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-12-07 19:34:53,761 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 9 [2019-12-07 19:34:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:53,762 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-12-07 19:34:53,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-12-07 19:34:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:34:53,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:53,762 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 19:34:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1195164347, now seen corresponding path program 1 times [2019-12-07 19:34:53,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742364272] [2019-12-07 19:34:53,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:53,826 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 19:34:53,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742364272] [2019-12-07 19:34:53,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:53,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:53,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052107584] [2019-12-07 19:34:53,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:34:53,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:34:53,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:34:53,828 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 6 states. [2019-12-07 19:34:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:53,883 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-12-07 19:34:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:53,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 19:34:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:53,884 INFO L225 Difference]: With dead ends: 73 [2019-12-07 19:34:53,884 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 19:34:53,885 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 19:34:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 19:34:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2019-12-07 19:34:53,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 19:34:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-12-07 19:34:53,890 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 11 [2019-12-07 19:34:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:53,890 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-12-07 19:34:53,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:34:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-12-07 19:34:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:34:53,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:53,891 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 19:34:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1195164346, now seen corresponding path program 1 times [2019-12-07 19:34:53,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336648692] [2019-12-07 19:34:53,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:53,943 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 19:34:53,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336648692] [2019-12-07 19:34:53,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:53,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:34:53,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277326976] [2019-12-07 19:34:53,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:53,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:53,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:53,944 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2019-12-07 19:34:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:53,984 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-12-07 19:34:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:53,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:34:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:53,985 INFO L225 Difference]: With dead ends: 53 [2019-12-07 19:34:53,985 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 19:34:53,986 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 19:34:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 19:34:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 19:34:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 19:34:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-12-07 19:34:53,989 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 11 [2019-12-07 19:34:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:53,989 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-12-07 19:34:53,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-12-07 19:34:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:34:53,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:53,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:53,990 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 19:34:53,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:53,991 INFO L82 PathProgramCache]: Analyzing trace with hash 142150231, now seen corresponding path program 1 times [2019-12-07 19:34:53,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:53,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719548331] [2019-12-07 19:34:53,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:54,021 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 19:34:54,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719548331] [2019-12-07 19:34:54,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:54,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:54,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188871194] [2019-12-07 19:34:54,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:54,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:54,022 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 5 states. [2019-12-07 19:34:54,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:54,120 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2019-12-07 19:34:54,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:34:54,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:34:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:54,121 INFO L225 Difference]: With dead ends: 112 [2019-12-07 19:34:54,121 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 19:34:54,122 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 19:34:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 19:34:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 56. [2019-12-07 19:34:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 19:34:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-12-07 19:34:54,126 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 14 [2019-12-07 19:34:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:54,126 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-12-07 19:34:54,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-12-07 19:34:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:34:54,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:54,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:54,127 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 19:34:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:54,127 INFO L82 PathProgramCache]: Analyzing trace with hash 142150232, now seen corresponding path program 1 times [2019-12-07 19:34:54,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:54,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504844749] [2019-12-07 19:34:54,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:54,192 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 19:34:54,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504844749] [2019-12-07 19:34:54,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:54,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:34:54,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626762162] [2019-12-07 19:34:54,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:34:54,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:54,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:34:54,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:34:54,194 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 7 states. [2019-12-07 19:34:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:54,349 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-12-07 19:34:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:34:54,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 19:34:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:54,350 INFO L225 Difference]: With dead ends: 94 [2019-12-07 19:34:54,350 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 19:34:54,351 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 19:34:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 19:34:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2019-12-07 19:34:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 19:34:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-12-07 19:34:54,354 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 14 [2019-12-07 19:34:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:54,354 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-12-07 19:34:54,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:34:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-12-07 19:34:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:34:54,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:54,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:54,356 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 19:34:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash 115588634, now seen corresponding path program 1 times [2019-12-07 19:34:54,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:54,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649283870] [2019-12-07 19:34:54,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:54,391 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 19:34:54,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649283870] [2019-12-07 19:34:54,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:54,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:54,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679987726] [2019-12-07 19:34:54,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:54,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:54,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:54,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:54,393 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 5 states. [2019-12-07 19:34:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:54,475 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2019-12-07 19:34:54,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:34:54,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 19:34:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:54,476 INFO L225 Difference]: With dead ends: 104 [2019-12-07 19:34:54,476 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 19:34:54,476 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 19:34:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 19:34:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2019-12-07 19:34:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 19:34:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2019-12-07 19:34:54,479 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 15 [2019-12-07 19:34:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:54,480 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2019-12-07 19:34:54,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2019-12-07 19:34:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:34:54,480 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:54,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:54,481 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 19:34:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash 115588635, now seen corresponding path program 1 times [2019-12-07 19:34:54,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:54,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982604988] [2019-12-07 19:34:54,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:54,540 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 19:34:54,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982604988] [2019-12-07 19:34:54,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:54,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:34:54,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845044734] [2019-12-07 19:34:54,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:34:54,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:34:54,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:34:54,541 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 7 states. [2019-12-07 19:34:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:54,660 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-12-07 19:34:54,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:34:54,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-07 19:34:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:54,661 INFO L225 Difference]: With dead ends: 89 [2019-12-07 19:34:54,661 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 19:34:54,661 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 19:34:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 19:34:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-12-07 19:34:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 19:34:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-12-07 19:34:54,663 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 15 [2019-12-07 19:34:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:54,664 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-12-07 19:34:54,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:34:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-12-07 19:34:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:34:54,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:54,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:54,664 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 19:34:54,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash 115688412, now seen corresponding path program 1 times [2019-12-07 19:34:54,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:54,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487574278] [2019-12-07 19:34:54,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:54,695 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 19:34:54,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487574278] [2019-12-07 19:34:54,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:54,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:54,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198505072] [2019-12-07 19:34:54,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:34:54,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:54,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:34:54,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:34:54,696 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 5 states. [2019-12-07 19:34:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:54,769 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-12-07 19:34:54,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:34:54,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 19:34:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:54,769 INFO L225 Difference]: With dead ends: 76 [2019-12-07 19:34:54,770 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 19:34:54,770 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 19:34:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 19:34:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2019-12-07 19:34:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 19:34:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-12-07 19:34:54,772 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 15 [2019-12-07 19:34:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:54,772 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-12-07 19:34:54,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:34:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2019-12-07 19:34:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:34:54,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:54,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:54,773 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 19:34:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash 115688413, now seen corresponding path program 1 times [2019-12-07 19:34:54,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:54,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034895444] [2019-12-07 19:34:54,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:54,794 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 19:34:54,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034895444] [2019-12-07 19:34:54,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:54,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:54,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701243317] [2019-12-07 19:34:54,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:54,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:54,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:54,795 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 4 states. [2019-12-07 19:34:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:54,809 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2019-12-07 19:34:54,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:54,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 19:34:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:54,811 INFO L225 Difference]: With dead ends: 87 [2019-12-07 19:34:54,811 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 19:34:54,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 19:34:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 19:34:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2019-12-07 19:34:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 19:34:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-12-07 19:34:54,814 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 15 [2019-12-07 19:34:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:54,814 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-12-07 19:34:54,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-12-07 19:34:54,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:34:54,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:54,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:54,815 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 19:34:54,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash -836222225, now seen corresponding path program 1 times [2019-12-07 19:34:54,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:54,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413547106] [2019-12-07 19:34:54,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:34:54,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413547106] [2019-12-07 19:34:54,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:54,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:34:54,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503219463] [2019-12-07 19:34:54,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:54,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:54,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:54,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:54,835 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 4 states. [2019-12-07 19:34:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:54,855 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2019-12-07 19:34:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:34:54,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 19:34:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:54,857 INFO L225 Difference]: With dead ends: 134 [2019-12-07 19:34:54,857 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 19:34:54,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 19:34:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 19:34:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 65. [2019-12-07 19:34:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 19:34:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-12-07 19:34:54,859 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 16 [2019-12-07 19:34:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:54,859 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-12-07 19:34:54,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-12-07 19:34:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:34:54,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:54,859 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:54,860 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 19:34:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1226200701, now seen corresponding path program 1 times [2019-12-07 19:34:54,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:54,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583239149] [2019-12-07 19:34:54,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:54,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583239149] [2019-12-07 19:34:54,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692487384] [2019-12-07 19:34:54,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:34:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:55,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 19:34:55,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:55,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,107 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 19:34:55,108 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:34:55,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:34:55,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-07 19:34:55,143 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 19:34:55,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:34:55,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:34:55,147 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 19:34:55,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,186 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 19:34:55,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:34:55,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:55,189 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 19:34:55,205 INFO L614 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-12-07 19:34:55,206 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 19:34:55,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2019-12-07 19:34:55,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:34:55,294 INFO L343 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-12-07 19:34:55,294 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2019-12-07 19:34:55,295 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:34:55,308 INFO L614 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-12-07 19:34:55,309 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 19:34:55,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-12-07 19:34:55,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,343 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 19:34:55,344 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:34:55,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,348 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 19:34:55,348 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-12-07 19:34:55,350 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 19:34:55,351 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:55,359 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 19:34:55,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,361 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 19:34:55,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-12-07 19:34:55,425 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,425 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 19:34:55,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:55,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:34:55,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:34:55,428 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 19:34:55,428 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:15 [2019-12-07 19:34:55,455 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:34:55,466 INFO L614 ElimStorePlain]: treesize reduction 10, result has 52.4 percent of original size [2019-12-07 19:34:55,466 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 19:34:55,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-12-07 19:34:55,500 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 19:34:55,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [321679908] [2019-12-07 19:34:55,516 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 19:34:55,516 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:34:55,519 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:34:55,523 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:34:55,524 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:34:55,593 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:55,740 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:55,911 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:55,925 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:56,231 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:56,244 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:56,280 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:56,797 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:56,811 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:56,823 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:57,020 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:57,032 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:57,043 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:58,184 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:58,220 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:58,230 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:34:58,260 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:34:59,234 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 108 [2019-12-07 19:34:59,465 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-12-07 19:34:59,714 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-12-07 19:34:59,952 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-12-07 19:35:00,499 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 95 [2019-12-07 19:35:01,386 WARN L192 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 233 [2019-12-07 19:35:01,837 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 19:35:01,839 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:35:01,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:35:01,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 21 [2019-12-07 19:35:01,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856784515] [2019-12-07 19:35:01,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 19:35:01,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:01,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 19:35:01,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 19:35:01,840 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 22 states. [2019-12-07 19:35:02,618 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-12-07 19:35:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:03,254 INFO L93 Difference]: Finished difference Result 253 states and 284 transitions. [2019-12-07 19:35:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 19:35:03,255 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2019-12-07 19:35:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:03,256 INFO L225 Difference]: With dead ends: 253 [2019-12-07 19:35:03,256 INFO L226 Difference]: Without dead ends: 253 [2019-12-07 19:35:03,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 19:35:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-12-07 19:35:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 86. [2019-12-07 19:35:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 19:35:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2019-12-07 19:35:03,260 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 19 [2019-12-07 19:35:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:03,260 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2019-12-07 19:35:03,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 19:35:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2019-12-07 19:35:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:35:03,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:03,261 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:03,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:03,463 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 19:35:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1226200700, now seen corresponding path program 1 times [2019-12-07 19:35:03,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:03,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816450439] [2019-12-07 19:35:03,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816450439] [2019-12-07 19:35:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177462220] [2019-12-07 19:35:03,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:03,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 19:35:03,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:04,127 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 19:35:04,127 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:04,745 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 19:35:04,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [530318083] [2019-12-07 19:35:04,746 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 19:35:04,746 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:04,746 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:35:04,747 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:35:04,747 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:35:04,779 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:04,861 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:04,977 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:04,999 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,255 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,285 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,294 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,716 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,765 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,776 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,940 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,957 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:05,969 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:07,085 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:07,116 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:07,123 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:07,150 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:35:08,261 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 109 [2019-12-07 19:35:08,512 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-12-07 19:35:08,808 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-12-07 19:35:09,091 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-12-07 19:35:09,566 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 97 [2019-12-07 19:35:10,535 WARN L192 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 235 [2019-12-07 19:35:11,136 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 19:35:11,137 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:35:11,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:35:11,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2019-12-07 19:35:11,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294746200] [2019-12-07 19:35:11,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 19:35:11,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:11,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 19:35:11,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 19:35:11,139 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 32 states. [2019-12-07 19:35:11,983 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 76 [2019-12-07 19:35:12,662 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 73 [2019-12-07 19:35:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:15,912 INFO L93 Difference]: Finished difference Result 438 states and 488 transitions. [2019-12-07 19:35:15,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 19:35:15,913 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 19 [2019-12-07 19:35:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:15,915 INFO L225 Difference]: With dead ends: 438 [2019-12-07 19:35:15,915 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 19:35:15,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=715, Invalid=4255, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 19:35:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 19:35:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 104. [2019-12-07 19:35:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 19:35:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2019-12-07 19:35:15,921 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 19 [2019-12-07 19:35:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:15,921 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2019-12-07 19:35:15,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 19:35:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2019-12-07 19:35:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:35:15,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:15,922 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 19:35:16,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:16,124 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 19:35:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash 207166043, now seen corresponding path program 1 times [2019-12-07 19:35:16,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:16,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619127423] [2019-12-07 19:35:16,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:35:16,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619127423] [2019-12-07 19:35:16,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366458531] [2019-12-07 19:35:16,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:16,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:35:16,234 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:35:16,250 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:35:16,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [524661984] [2019-12-07 19:35:16,260 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 19:35:16,260 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:16,261 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:35:16,261 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:35:16,261 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:35:16,287 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:16,374 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:16,483 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:16,492 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:16,725 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:16,735 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:16,745 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:17,450 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:17,481 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:17,488 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:17,516 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:35:18,134 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 108 [2019-12-07 19:35:18,308 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 77 [2019-12-07 19:35:18,476 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-12-07 19:35:18,674 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-12-07 19:35:19,103 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 95 [2019-12-07 19:35:20,011 WARN L192 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 132 [2019-12-07 19:35:21,097 WARN L192 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 132 [2019-12-07 19:35:21,577 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 128 [2019-12-07 19:35:21,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:35:21,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 4, 4] total 17 [2019-12-07 19:35:21,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632824777] [2019-12-07 19:35:21,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:35:21,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:35:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:35:21,580 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand 12 states. [2019-12-07 19:35:21,774 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 75 [2019-12-07 19:35:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:22,271 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2019-12-07 19:35:22,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:35:22,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-12-07 19:35:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:22,272 INFO L225 Difference]: With dead ends: 82 [2019-12-07 19:35:22,272 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 19:35:22,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:35:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 19:35:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-07 19:35:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 19:35:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-12-07 19:35:22,275 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 20 [2019-12-07 19:35:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:22,275 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-12-07 19:35:22,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:35:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-12-07 19:35:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:35:22,276 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:22,276 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 19:35:22,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:22,477 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 19:35:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1561475301, now seen corresponding path program 2 times [2019-12-07 19:35:22,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:22,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309247029] [2019-12-07 19:35:22,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:22,509 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 19:35:22,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309247029] [2019-12-07 19:35:22,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484748366] [2019-12-07 19:35:22,509 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:22,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 19:35:22,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:35:22,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:35:22,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:35:22,605 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:35:22,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [439185389] [2019-12-07 19:35:22,618 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 19:35:22,618 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:22,618 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:35:22,619 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:35:22,619 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:35:22,649 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:22,738 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:22,852 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:22,874 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,109 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,121 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,149 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,595 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,607 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,618 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,759 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,771 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:23,817 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:24,869 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:24,901 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:24,924 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:35:24,953 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:35:25,687 WARN L192 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 109 [2019-12-07 19:35:25,863 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-12-07 19:35:26,053 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-12-07 19:35:26,261 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-12-07 19:35:26,669 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 97 [2019-12-07 19:35:27,422 WARN L192 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 235 [2019-12-07 19:35:27,778 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 19:35:27,778 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:35:27,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:35:27,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 7 [2019-12-07 19:35:27,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963526085] [2019-12-07 19:35:27,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:35:27,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:27,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:35:27,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:35:27,779 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 7 states. [2019-12-07 19:35:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:27,886 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2019-12-07 19:35:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:35:27,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 19:35:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:27,887 INFO L225 Difference]: With dead ends: 113 [2019-12-07 19:35:27,887 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 19:35:27,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:35:27,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 19:35:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2019-12-07 19:35:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 19:35:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2019-12-07 19:35:27,889 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 21 [2019-12-07 19:35:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:27,889 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2019-12-07 19:35:27,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:35:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2019-12-07 19:35:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:35:27,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:27,889 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 19:35:28,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:28,091 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 19:35:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1026074759, now seen corresponding path program 1 times [2019-12-07 19:35:28,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:28,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28560538] [2019-12-07 19:35:28,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:28,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28560538] [2019-12-07 19:35:28,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151677751] [2019-12-07 19:35:28,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:28,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-07 19:35:28,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:28,912 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:29,717 WARN L192 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 19:35:30,690 WARN L192 SmtUtils]: Spent 799.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 19:35:30,837 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-12-07 19:35:31,045 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@348412fa [2019-12-07 19:35:31,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [93333159] [2019-12-07 19:35:31,046 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-12-07 19:35:31,046 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:31,047 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:35:31,047 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:35:31,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:35:31,054 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@348412fa 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 19:35:31,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:35:31,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-12-07 19:35:31,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259918393] [2019-12-07 19:35:31,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 19:35:31,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:31,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 19:35:31,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1590, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 19:35:31,057 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand 18 states. [2019-12-07 19:35:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:35:31,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:31,258 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@348412fa 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 19:35:31,260 INFO L168 Benchmark]: Toolchain (without parser) took 38936.45 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 540.0 MB). Free memory was 940.7 MB in the beginning and 833.4 MB in the end (delta: 107.4 MB). Peak memory consumption was 647.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:35:31,260 INFO L168 Benchmark]: CDTParser took 0.13 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 19:35:31,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:35:31,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.79 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 19:35:31,260 INFO L168 Benchmark]: Boogie Preprocessor took 22.88 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 19:35:31,261 INFO L168 Benchmark]: RCFGBuilder took 394.30 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.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:35:31,261 INFO L168 Benchmark]: TraceAbstraction took 38123.37 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 434.1 MB). Free memory was 1.0 GB in the beginning and 833.4 MB in the end (delta: 192.6 MB). Peak memory consumption was 626.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:35:31,262 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.79 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.88 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 394.30 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.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38123.37 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 434.1 MB). Free memory was 1.0 GB in the beginning and 833.4 MB in the end (delta: 192.6 MB). Peak memory consumption was 626.7 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@348412fa de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@348412fa: 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 19:35:32,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:35:32,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:35:32,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:35:32,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:35:32,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:35:32,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:35:32,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:35:32,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:35:32,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:35:32,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:35:32,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:35:32,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:35:32,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:35:32,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:35:32,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:35:32,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:35:32,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:35:32,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:35:32,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:35:32,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:35:32,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:35:32,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:35:32,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:35:32,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:35:32,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:35:32,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:35:32,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:35:32,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:35:32,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:35:32,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:35:32,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:35:32,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:35:32,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:35:32,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:35:32,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:35:32,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:35:32,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:35:32,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:35:32,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:35:32,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:35:32,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 19:35:32,662 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:35:32,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:35:32,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:35:32,663 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:35:32,664 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:35:32,664 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:35:32,664 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:35:32,664 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:35:32,664 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:35:32,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:35:32,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:35:32,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:35:32,665 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:35:32,665 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:35:32,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:35:32,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:35:32,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:35:32,666 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:35:32,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:35:32,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:35:32,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:35:32,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:35:32,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:35:32,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:35:32,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:35:32,668 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 19:35:32,668 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 19:35:32,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:35:32,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:35:32,668 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_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 -> abd6dbc145d5f477746656086724ee83e0738836 [2019-12-07 19:35:32,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:35:32,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:35:32,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:35:32,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:35:32,849 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:35:32,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-12-07 19:35:32,890 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data/7c32a2aeb/d92c4f57048a494ea10453113ec760df/FLAG977c64f6d [2019-12-07 19:35:33,349 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:35:33,349 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/sv-benchmarks/c/list-simple/sll2c_update_all.i [2019-12-07 19:35:33,358 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data/7c32a2aeb/d92c4f57048a494ea10453113ec760df/FLAG977c64f6d [2019-12-07 19:35:33,677 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/data/7c32a2aeb/d92c4f57048a494ea10453113ec760df [2019-12-07 19:35:33,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:35:33,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:35:33,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:35:33,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:35:33,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:35:33,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:35:33" (1/1) ... [2019-12-07 19:35:33,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e089cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:33, skipping insertion in model container [2019-12-07 19:35:33,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:35:33" (1/1) ... [2019-12-07 19:35:33,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:35:33,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:35:33,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:35:33,983 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:35:34,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:35:34,053 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:35:34,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34 WrapperNode [2019-12-07 19:35:34,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:35:34,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:35:34,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:35:34,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:35:34,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:35:34,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:35:34,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:35:34,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:35:34,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... [2019-12-07 19:35:34,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:35:34,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:35:34,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:35:34,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:35:34,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 19:35:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:35:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:35:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:35:34,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:35:34,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 19:35:34,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:35:34,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:35:34,515 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:35:34,515 INFO L287 CfgBuilder]: Removed 26 assume(true) statements. [2019-12-07 19:35:34,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:35:34 BoogieIcfgContainer [2019-12-07 19:35:34,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:35:34,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:35:34,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:35:34,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:35:34,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:35:33" (1/3) ... [2019-12-07 19:35:34,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4421358a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:35:34, skipping insertion in model container [2019-12-07 19:35:34,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:35:34" (2/3) ... [2019-12-07 19:35:34,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4421358a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:35:34, skipping insertion in model container [2019-12-07 19:35:34,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:35:34" (3/3) ... [2019-12-07 19:35:34,521 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2019-12-07 19:35:34,527 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:35:34,532 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 32 error locations. [2019-12-07 19:35:34,539 INFO L249 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2019-12-07 19:35:34,552 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:35:34,552 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:35:34,552 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:35:34,552 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:35:34,552 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:35:34,552 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:35:34,552 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:35:34,552 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:35:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2019-12-07 19:35:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 19:35:34,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:34,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 19:35:34,570 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 19:35:34,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash 925702, now seen corresponding path program 1 times [2019-12-07 19:35:34,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:34,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146505292] [2019-12-07 19:35:34,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:34,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:35:34,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:34,666 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 19:35:34,666 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:34,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:34,672 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:34,672 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:35:34,678 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 19:35:34,678 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:34,681 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 19:35:34,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146505292] [2019-12-07 19:35:34,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:34,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 19:35:34,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95855076] [2019-12-07 19:35:34,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:35:34,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:34,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:35:34,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:34,697 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 3 states. [2019-12-07 19:35:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:34,831 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-12-07 19:35:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:35:34,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 19:35:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:34,839 INFO L225 Difference]: With dead ends: 104 [2019-12-07 19:35:34,839 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 19:35:34,840 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 19:35:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 19:35:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2019-12-07 19:35:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 19:35:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-12-07 19:35:34,866 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 4 [2019-12-07 19:35:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:34,867 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-12-07 19:35:34,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:35:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-12-07 19:35:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 19:35:34,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:34,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 19:35:35,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 19:35:35,069 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 19:35:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash 925703, now seen corresponding path program 1 times [2019-12-07 19:35:35,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:35,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554124063] [2019-12-07 19:35:35,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:35,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:35:35,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:35,157 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 19:35:35,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:35,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:35,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:35,163 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:35:35,170 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 19:35:35,170 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:35,209 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 19:35:35,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554124063] [2019-12-07 19:35:35,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:35,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 19:35:35,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731236455] [2019-12-07 19:35:35,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:35:35,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:35:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:35:35,211 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 4 states. [2019-12-07 19:35:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:35,320 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2019-12-07 19:35:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:35:35,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 19:35:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:35,321 INFO L225 Difference]: With dead ends: 74 [2019-12-07 19:35:35,321 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 19:35:35,322 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 19:35:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 19:35:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 19:35:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 19:35:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-12-07 19:35:35,328 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 4 [2019-12-07 19:35:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:35,328 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-12-07 19:35:35,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:35:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-12-07 19:35:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:35:35,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:35,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:35,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 19:35:35,530 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 19:35:35,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:35,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2097994085, now seen corresponding path program 1 times [2019-12-07 19:35:35,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:35,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524238526] [2019-12-07 19:35:35,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:35,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:35:35,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:35,620 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:35,626 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 19:35:35,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524238526] [2019-12-07 19:35:35,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:35,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 19:35:35,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340208626] [2019-12-07 19:35:35,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:35:35,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:35,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:35:35,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:35:35,628 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 4 states. [2019-12-07 19:35:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:35,642 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-12-07 19:35:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:35:35,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 19:35:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:35,643 INFO L225 Difference]: With dead ends: 84 [2019-12-07 19:35:35,643 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 19:35:35,644 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 19:35:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 19:35:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-12-07 19:35:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 19:35:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-12-07 19:35:35,650 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 9 [2019-12-07 19:35:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:35,650 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-12-07 19:35:35,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:35:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-12-07 19:35:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:35:35,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:35,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:35,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 19:35:35,852 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 19:35:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash 231455864, now seen corresponding path program 1 times [2019-12-07 19:35:35,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:35,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219970840] [2019-12-07 19:35:35,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:35,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:35:35,952 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:35,957 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 19:35:35,957 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:35,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:35,960 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:35,960 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:35:35,975 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 19:35:35,975 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:35,987 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 19:35:35,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219970840] [2019-12-07 19:35:35,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:35,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 19:35:35,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201710013] [2019-12-07 19:35:35,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:35:35,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:35:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:35:35,990 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 5 states. [2019-12-07 19:35:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:36,209 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-12-07 19:35:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:35:36,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:35:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:36,210 INFO L225 Difference]: With dead ends: 99 [2019-12-07 19:35:36,210 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 19:35:36,211 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 19:35:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 19:35:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2019-12-07 19:35:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 19:35:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2019-12-07 19:35:36,217 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 14 [2019-12-07 19:35:36,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:36,217 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2019-12-07 19:35:36,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:35:36,218 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2019-12-07 19:35:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:35:36,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:36,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:36,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 19:35:36,420 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 19:35:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash 231455865, now seen corresponding path program 1 times [2019-12-07 19:35:36,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:36,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150938907] [2019-12-07 19:35:36,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:36,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:35:36,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:36,513 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 19:35:36,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:36,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:36,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:36,519 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:35:36,544 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 19:35:36,544 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:36,655 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 19:35:36,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150938907] [2019-12-07 19:35:36,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:36,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 19:35:36,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625068598] [2019-12-07 19:35:36,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:35:36,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:36,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:35:36,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:35:36,657 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 8 states. [2019-12-07 19:35:36,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:36,966 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-12-07 19:35:36,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:35:36,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 19:35:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:36,967 INFO L225 Difference]: With dead ends: 78 [2019-12-07 19:35:36,967 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 19:35:36,968 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 19:35:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 19:35:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2019-12-07 19:35:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 19:35:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2019-12-07 19:35:36,971 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 14 [2019-12-07 19:35:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:36,972 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2019-12-07 19:35:36,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:35:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2019-12-07 19:35:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:35:36,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:36,972 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 19:35:37,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 19:35:37,175 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 19:35:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:37,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1879150547, now seen corresponding path program 1 times [2019-12-07 19:35:37,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:37,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321929830] [2019-12-07 19:35:37,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:37,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:35:37,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:37,290 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 19:35:37,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:37,292 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:37,292 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:37,292 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:35:37,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:37,318 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 19:35:37,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:37,331 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 19:35:37,331 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 19:35:37,332 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-12-07 19:35:37,342 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 19:35:37,342 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:37,365 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 19:35:37,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321929830] [2019-12-07 19:35:37,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:37,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 19:35:37,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976801059] [2019-12-07 19:35:37,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:35:37,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:37,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:35:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:35:37,367 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 5 states. [2019-12-07 19:35:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:37,527 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-12-07 19:35:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:35:37,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 19:35:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:37,528 INFO L225 Difference]: With dead ends: 92 [2019-12-07 19:35:37,528 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 19:35:37,529 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 19:35:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 19:35:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2019-12-07 19:35:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 19:35:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-12-07 19:35:37,533 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 17 [2019-12-07 19:35:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:37,533 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-12-07 19:35:37,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:35:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-12-07 19:35:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:35:37,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:37,533 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 19:35:37,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 19:35:37,735 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 19:35:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1879150548, now seen corresponding path program 1 times [2019-12-07 19:35:37,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:37,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853333269] [2019-12-07 19:35:37,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:37,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 19:35:37,881 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:37,887 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 19:35:37,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:37,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:37,898 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 19:35:37,898 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:37,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:37,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:37,904 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:35:37,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:35:37,942 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 19:35:37,943 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:37,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:37,961 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:37,961 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 19:35:37,962 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:37,971 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:37,971 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 19:35:37,980 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 19:35:38,012 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 19:35:38,012 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:38,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:35:38,294 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 19:35:38,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853333269] [2019-12-07 19:35:38,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [922948612] [2019-12-07 19:35:38,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:38,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 19:35:38,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:38,413 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 19:35:38,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,421 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 19:35:38,421 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,426 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:35:38,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:35:38,433 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 19:35:38,433 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,449 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,449 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 19:35:38,450 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,457 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 19:35:38,457 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 19:35:38,473 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 19:35:38,474 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:38,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:35:38,576 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 19:35:38,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428160746] [2019-12-07 19:35:38,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:38,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 19:35:38,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:38,657 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 19:35:38,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,666 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 19:35:38,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,675 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,675 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:35:38,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,691 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 19:35:38,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,702 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 19:35:38,702 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:38,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:38,710 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 19:35:38,710 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-12-07 19:35:38,725 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 19:35:38,725 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:38,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:35:38,820 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 19:35:38,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:35:38,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2019-12-07 19:35:38,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073849642] [2019-12-07 19:35:38,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:35:38,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:38,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:35:38,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:35:38,822 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 10 states. [2019-12-07 19:35:39,346 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 19:35:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:40,987 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-12-07 19:35:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:35:40,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 19:35:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:40,989 INFO L225 Difference]: With dead ends: 111 [2019-12-07 19:35:40,989 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 19:35:40,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:35:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 19:35:40,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2019-12-07 19:35:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 19:35:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2019-12-07 19:35:40,993 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 17 [2019-12-07 19:35:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:40,993 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2019-12-07 19:35:40,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:35:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2019-12-07 19:35:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:35:40,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:40,993 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 19:35:41,595 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 19:35:41,596 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 19:35:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash -687020393, now seen corresponding path program 1 times [2019-12-07 19:35:41,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:41,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006477405] [2019-12-07 19:35:41,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:41,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:35:41,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:41,709 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 19:35:41,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:41,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:41,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:41,711 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:35:41,751 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 19:35:41,751 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:41,758 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 19:35:41,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006477405] [2019-12-07 19:35:41,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:41,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-07 19:35:41,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845838100] [2019-12-07 19:35:41,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:35:41,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:35:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:35:41,759 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2019-12-07 19:35:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:42,319 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2019-12-07 19:35:42,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:35:42,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-12-07 19:35:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:42,320 INFO L225 Difference]: With dead ends: 144 [2019-12-07 19:35:42,320 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 19:35:42,321 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 19:35:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 19:35:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 74. [2019-12-07 19:35:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 19:35:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2019-12-07 19:35:42,324 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 22 [2019-12-07 19:35:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:42,324 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2019-12-07 19:35:42,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:35:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2019-12-07 19:35:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:35:42,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:42,325 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 19:35:42,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 19:35:42,526 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 19:35:42,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:42,526 INFO L82 PathProgramCache]: Analyzing trace with hash -687020392, now seen corresponding path program 1 times [2019-12-07 19:35:42,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:42,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973994060] [2019-12-07 19:35:42,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:42,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 19:35:42,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:42,617 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 19:35:42,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:42,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:42,622 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:42,622 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:35:42,694 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 19:35:42,694 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:43,129 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 19:35:43,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973994060] [2019-12-07 19:35:43,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:43,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-12-07 19:35:43,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071026659] [2019-12-07 19:35:43,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:35:43,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:43,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:35:43,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:35:43,130 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 16 states. [2019-12-07 19:35:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:44,426 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2019-12-07 19:35:44,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:35:44,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-12-07 19:35:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:44,429 INFO L225 Difference]: With dead ends: 167 [2019-12-07 19:35:44,429 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 19:35:44,429 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 19:35:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 19:35:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 74. [2019-12-07 19:35:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 19:35:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-12-07 19:35:44,433 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 22 [2019-12-07 19:35:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:44,433 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-12-07 19:35:44,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:35:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-12-07 19:35:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:35:44,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:44,434 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] [2019-12-07 19:35:44,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 19:35:44,636 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 19:35:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1197103645, now seen corresponding path program 1 times [2019-12-07 19:35:44,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:44,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361307719] [2019-12-07 19:35:44,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:44,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:35:44,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:44,804 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 19:35:44,805 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:44,817 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 19:35:44,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361307719] [2019-12-07 19:35:44,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:44,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 19:35:44,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246736348] [2019-12-07 19:35:44,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:35:44,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:35:44,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:35:44,819 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2019-12-07 19:35:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:44,862 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2019-12-07 19:35:44,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:35:44,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 19:35:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:44,864 INFO L225 Difference]: With dead ends: 104 [2019-12-07 19:35:44,864 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 19:35:44,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:35:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 19:35:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-12-07 19:35:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-07 19:35:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-12-07 19:35:44,868 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 24 [2019-12-07 19:35:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:44,868 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-12-07 19:35:44,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:35:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-12-07 19:35:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:35:44,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:44,869 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 19:35:45,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 19:35:45,071 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 19:35:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:45,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1503677429, now seen corresponding path program 1 times [2019-12-07 19:35:45,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:45,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991973835] [2019-12-07 19:35:45,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:35:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:45,208 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:35:45,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:35:45,215 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:35:45,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991973835] [2019-12-07 19:35:45,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:45,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 19:35:45,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125971043] [2019-12-07 19:35:45,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:35:45,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:35:45,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:35:45,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:35:45,227 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 6 states. [2019-12-07 19:35:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:45,266 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-12-07 19:35:45,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:35:45,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 19:35:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:45,267 INFO L225 Difference]: With dead ends: 95 [2019-12-07 19:35:45,267 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 19:35:45,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:35:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 19:35:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2019-12-07 19:35:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 19:35:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-12-07 19:35:45,270 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 25 [2019-12-07 19:35:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:45,270 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-12-07 19:35:45,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:35:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-12-07 19:35:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:35:45,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:45,271 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 19:35:45,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 19:35:45,472 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 19:35:45,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:45,473 INFO L82 PathProgramCache]: Analyzing trace with hash -966118025, now seen corresponding path program 1 times [2019-12-07 19:35:45,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:35:45,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012921551] [2019-12-07 19:35:45,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 19:35:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:45,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 19:35:45,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:45,631 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 19:35:45,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:45,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:45,633 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:45,633 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:35:45,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:45,653 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 19:35:45,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:45,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:45,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:45,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2019-12-07 19:35:45,714 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 19:35:45,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:45,720 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:45,721 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:45,721 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 19:35:45,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:45,777 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 19:35:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:35:45,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:35:45,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 19:35:45,807 INFO L614 ElimStorePlain]: treesize reduction 35, result has 47.8 percent of original size [2019-12-07 19:35:45,807 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 19:35:45,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-12-07 19:35:45,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:35:54,108 WARN L192 SmtUtils]: Spent 8.12 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 19:35:54,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:54,108 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 78 [2019-12-07 19:35:54,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:54,132 INFO L614 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2019-12-07 19:35:54,132 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 19:35:54,132 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:32 [2019-12-07 19:35:54,184 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:54,185 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 19:35:54,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:54,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:54,189 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 19:35:54,189 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:7 [2019-12-07 19:35:54,244 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 19:35:54,244 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:54,335 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 19:35:54,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:54,341 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 19:35:54,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:19 [2019-12-07 19:35:57,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:57,355 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 19:35:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:35:57,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:57,359 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:57,359 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 19:35:57,359 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2019-12-07 19:35:57,475 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:57,493 INFO L614 ElimStorePlain]: treesize reduction 10, result has 52.4 percent of original size [2019-12-07 19:35:57,493 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 19:35:57,493 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:3 [2019-12-07 19:35:57,565 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 19:35:57,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012921551] [2019-12-07 19:35:57,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1509714102] [2019-12-07 19:35:57,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:35:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:57,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 19:35:57,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:57,729 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 19:35:57,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:57,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:57,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:57,731 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:35:57,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:57,747 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 19:35:57,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:57,768 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-12-07 19:35:57,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:57,769 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 19:35:57,921 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 19:35:57,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:57,929 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:57,930 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:35:57,930 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-12-07 19:35:58,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:58,069 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 19:35:58,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:35:58,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:35:58,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:35:58,081 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 19:35:58,081 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:39 [2019-12-07 19:35:58,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:36:06,576 WARN L192 SmtUtils]: Spent 8.17 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 19:36:06,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:06,577 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 78 [2019-12-07 19:36:06,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:06,606 INFO L614 ElimStorePlain]: treesize reduction 46, result has 45.9 percent of original size [2019-12-07 19:36:06,606 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 19:36:06,606 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:39 [2019-12-07 19:36:06,703 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:06,703 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 19:36:06,703 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:06,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:06,709 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 19:36:06,709 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2019-12-07 19:36:06,839 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 19:36:06,840 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:36:06,891 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 19:36:06,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:06,895 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 19:36:06,895 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2019-12-07 19:36:10,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:10,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:10,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:36:10,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:36:10,460 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 19:36:10,460 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:36 [2019-12-07 19:36:11,706 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 19:36:11,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203565741] [2019-12-07 19:36:11,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:36:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:11,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 19:36:11,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:36:11,765 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 19:36:11,766 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:11,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:11,768 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:36:11,768 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:36:11,776 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:11,776 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 19:36:11,776 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:11,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:11,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:36:11,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 19:36:11,986 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 19:36:11,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:11,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:11,992 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:36:11,992 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 19:36:12,158 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:12,158 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 19:36:12,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:36:12,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:36:12,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 19:36:12,184 INFO L614 ElimStorePlain]: treesize reduction 34, result has 46.0 percent of original size [2019-12-07 19:36:12,185 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 19:36:12,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2019-12-07 19:36:30,362 WARN L192 SmtUtils]: Spent 16.30 s on a formula simplification. DAG size of input: 34 DAG size of output: 25 [2019-12-07 19:36:30,362 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-12-07 19:36:30,363 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 50 treesize of output 66 [2019-12-07 19:36:30,363 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:30,387 INFO L614 ElimStorePlain]: treesize reduction 46, result has 38.7 percent of original size [2019-12-07 19:36:30,388 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 19:36:30,388 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:29 [2019-12-07 19:36:30,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:30,506 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 19:36:30,506 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:30,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:30,510 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 19:36:30,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:5 [2019-12-07 19:36:30,534 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 19:36:30,534 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:36:30,560 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 19:36:30,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:30,564 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 19:36:30,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2019-12-07 19:36:34,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:34,050 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 19:36:34,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:36:34,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:34,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:36:34,053 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 19:36:34,053 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2019-12-07 19:36:34,056 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:36:34,074 INFO L614 ElimStorePlain]: treesize reduction 10, result has 52.4 percent of original size [2019-12-07 19:36:34,074 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 19:36:34,074 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:3 [2019-12-07 19:36:34,126 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 19:36:34,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:36:34,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 16, 16, 16, 12] total 55 [2019-12-07 19:36:34,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574036442] [2019-12-07 19:36:34,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 19:36:34,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:36:34,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 19:36:34,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2836, Unknown=1, NotChecked=0, Total=3080 [2019-12-07 19:36:34,128 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand 56 states. [2019-12-07 19:36:35,704 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-12-07 19:36:36,141 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-12-07 19:36:36,431 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-12-07 19:36:38,012 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-07 19:36:40,492 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 19:36:43,802 WARN L192 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-12-07 19:36:44,049 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-12-07 19:36:46,874 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-12-07 19:36:51,227 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 19:36:55,434 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 19:36:57,726 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-12-07 19:37:02,606 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 19:37:08,969 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 19:37:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:37:10,260 INFO L93 Difference]: Finished difference Result 441 states and 507 transitions. [2019-12-07 19:37:10,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 19:37:10,261 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 29 [2019-12-07 19:37:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:37:10,264 INFO L225 Difference]: With dead ends: 441 [2019-12-07 19:37:10,264 INFO L226 Difference]: Without dead ends: 441 [2019-12-07 19:37:10,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 101 SyntacticMatches, 14 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2861 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=1406, Invalid=7900, Unknown=6, NotChecked=0, Total=9312 [2019-12-07 19:37:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-12-07 19:37:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 122. [2019-12-07 19:37:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-07 19:37:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2019-12-07 19:37:10,271 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 29 [2019-12-07 19:37:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:37:10,272 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2019-12-07 19:37:10,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 19:37:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2019-12-07 19:37:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:37:10,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:37:10,272 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 19:37:10,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:37:10,875 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 19:37:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:37:10,876 INFO L82 PathProgramCache]: Analyzing trace with hash -966118024, now seen corresponding path program 1 times [2019-12-07 19:37:10,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:37:10,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912452984] [2019-12-07 19:37:10,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 19:37:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:11,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 19:37:11,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:37:11,083 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 19:37:11,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,092 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 19:37:11,092 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,097 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,097 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:37:11,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,132 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 19:37:11,132 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,149 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 19:37:11,149 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,160 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,160 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:24 [2019-12-07 19:37:11,231 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 19:37:11,231 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,249 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 19:37:11,249 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,261 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-12-07 19:37:11,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,352 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 19:37:11,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:11,353 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,375 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 19:37:11,376 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:11,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:11,392 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 19:37:11,392 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:59 [2019-12-07 19:37:11,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:37:19,788 WARN L192 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 19:37:19,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:19,788 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 83 [2019-12-07 19:37:19,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:19,854 INFO L614 ElimStorePlain]: treesize reduction 46, result has 61.7 percent of original size [2019-12-07 19:37:19,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:37:19,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-12-07 19:37:19,859 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:19,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:19,874 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 19:37:19,874 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:55 [2019-12-07 19:37:19,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:19,996 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 19:37:19,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:20,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:20,014 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 19:37:20,014 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:20,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:20,023 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 19:37:20,023 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:18 [2019-12-07 19:37:20,130 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 19:37:20,130 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:37:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:20,610 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 19:37:20,615 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:20,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:20,666 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 19:37:20,672 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 19:37:20,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:20,715 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 19:37:20,715 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:71 [2019-12-07 19:37:22,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:22,437 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 19:37:22,438 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:22,444 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:22,560 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 19:37:22,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:22,566 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:22,768 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-12-07 19:37:22,769 INFO L614 ElimStorePlain]: treesize reduction 50, result has 56.5 percent of original size [2019-12-07 19:37:22,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:22,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:22,770 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 19:37:22,770 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:127, output treesize:47 [2019-12-07 19:37:23,110 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-12-07 19:37:23,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:24,719 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 19:37:24,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912452984] [2019-12-07 19:37:24,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1837266949] [2019-12-07 19:37:24,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:37:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:24,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 19:37:24,909 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:37:24,912 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 19:37:24,913 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:24,920 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 19:37:24,921 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:24,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,926 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:37:24,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:37:24,932 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 19:37:24,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,945 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:24,951 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:24,951 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 19:37:24,952 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:24,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,963 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:24 [2019-12-07 19:37:24,969 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 19:37:24,969 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:24,986 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 19:37:24,986 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:24,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:24,997 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-12-07 19:37:25,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, 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 19:37:25,003 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:25,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:25,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:25,043 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 48 treesize of output 58 [2019-12-07 19:37:25,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:37:25,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:25,045 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 19:37:25,090 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.3 percent of original size [2019-12-07 19:37:25,090 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 19:37:25,090 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2019-12-07 19:37:25,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:37:33,289 WARN L192 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 19:37:33,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:33,290 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 83 [2019-12-07 19:37:33,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:33,359 INFO L614 ElimStorePlain]: treesize reduction 46, result has 61.7 percent of original size [2019-12-07 19:37:33,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:37:33,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-12-07 19:37:33,364 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:33,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:33,379 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 19:37:33,379 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:55 [2019-12-07 19:37:33,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:33,433 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 19:37:33,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:33,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:33,449 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 19:37:33,450 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:33,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:33,458 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 19:37:33,458 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:20 [2019-12-07 19:37:33,552 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 19:37:33,552 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:37:33,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:33,560 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 19:37:33,565 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:33,610 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:33,614 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 19:37:33,618 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 19:37:33,657 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:33,657 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 19:37:33,657 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:71 [2019-12-07 19:37:34,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:34,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:34,666 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:34,836 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-07 19:37:34,836 INFO L614 ElimStorePlain]: treesize reduction 50, result has 65.8 percent of original size [2019-12-07 19:37:34,844 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:34,951 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 19:37:34,951 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:34,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:34,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:34,952 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 19:37:34,952 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:127, output treesize:47 [2019-12-07 19:37:34,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:35,424 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 19:37:35,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587239074] [2019-12-07 19:37:35,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:37:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:37:35,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 19:37:35,477 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:37:35,481 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 19:37:35,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,486 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:35,488 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 19:37:35,488 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:35,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,493 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 19:37:35,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:37:35,499 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 19:37:35,499 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:35,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:35,519 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 19:37:35,519 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:35,528 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,528 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2019-12-07 19:37:35,825 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 19:37:35,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:35,842 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 19:37:35,842 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:35,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:37:35,853 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-12-07 19:37:36,069 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 19:37:36,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:36,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:36,105 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:36,105 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 48 treesize of output 58 [2019-12-07 19:37:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:36,106 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:36,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:36,120 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 19:37:36,120 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2019-12-07 19:37:36,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:37:36,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-12-07 19:37:36,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:36,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:36,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:37:44,854 WARN L192 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 19:37:44,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:44,855 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 83 [2019-12-07 19:37:44,855 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:44,895 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-07 19:37:44,896 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 19:37:44,896 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:52 [2019-12-07 19:37:45,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:45,219 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 19:37:45,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:45,232 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:45,235 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 19:37:45,235 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:45,244 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:45,244 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 19:37:45,244 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:20 [2019-12-07 19:37:45,342 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 19:37:45,342 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:37:45,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:45,351 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 19:37:45,355 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 19:37:45,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:45,433 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:45,438 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 19:37:45,467 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:45,467 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 19:37:45,467 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:71 [2019-12-07 19:37:46,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:46,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:46,511 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:46,722 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-12-07 19:37:46,722 INFO L614 ElimStorePlain]: treesize reduction 50, result has 65.8 percent of original size [2019-12-07 19:37:46,728 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:37:46,828 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:37:46,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:37:46,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:46,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:46,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:37:46,831 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 19:37:46,831 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:127, output treesize:62 [2019-12-07 19:37:47,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:37:48,294 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 19:37:48,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:37:48,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 16, 16, 16] total 47 [2019-12-07 19:37:48,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954162994] [2019-12-07 19:37:48,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 19:37:48,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:37:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 19:37:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2084, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 19:37:48,296 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 48 states. [2019-12-07 19:37:50,451 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-12-07 19:37:50,815 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-12-07 19:37:51,158 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2019-12-07 19:37:51,563 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2019-12-07 19:37:51,979 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-07 19:37:52,493 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 119 [2019-12-07 19:37:53,243 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 123 [2019-12-07 19:37:53,659 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-12-07 19:37:54,324 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 104 [2019-12-07 19:38:01,528 WARN L192 SmtUtils]: Spent 6.82 s on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-07 19:38:02,925 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 19:38:04,972 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 19:38:05,345 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-12-07 19:38:05,877 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 [2019-12-07 19:38:06,592 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 19:38:07,355 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 106 [2019-12-07 19:38:08,204 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 19:38:09,761 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-07 19:38:10,348 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-12-07 19:38:10,814 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2019-12-07 19:38:11,413 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-12-07 19:38:12,591 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 19:38:13,126 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 94 [2019-12-07 19:38:14,082 WARN L192 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103 [2019-12-07 19:38:14,779 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-12-07 19:38:15,891 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 119 [2019-12-07 19:38:16,601 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 19:38:22,092 WARN L192 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2019-12-07 19:38:23,058 WARN L192 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 110 [2019-12-07 19:38:23,451 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-12-07 19:38:24,226 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-12-07 19:38:25,042 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 19:38:25,927 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-12-07 19:38:27,463 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 108 [2019-12-07 19:38:28,888 WARN L192 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 19:38:29,650 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-12-07 19:38:31,034 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-12-07 19:38:34,300 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-07 19:38:35,814 WARN L192 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2019-12-07 19:38:49,503 WARN L192 SmtUtils]: Spent 10.98 s on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-12-07 19:38:51,272 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-12-07 19:38:52,394 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 19:39:08,059 WARN L192 SmtUtils]: Spent 6.50 s on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 19:39:14,657 WARN L192 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 19:39:15,567 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-12-07 19:39:18,828 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 19:39:19,840 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 19:39:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:39:24,901 INFO L93 Difference]: Finished difference Result 729 states and 811 transitions. [2019-12-07 19:39:24,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-07 19:39:24,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 29 [2019-12-07 19:39:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:39:24,905 INFO L225 Difference]: With dead ends: 729 [2019-12-07 19:39:24,906 INFO L226 Difference]: Without dead ends: 729 [2019-12-07 19:39:24,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 105 SyntacticMatches, 17 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3168 ImplicationChecksByTransitivity, 82.3s TimeCoverageRelationStatistics Valid=1900, Invalid=9226, Unknown=4, NotChecked=0, Total=11130 [2019-12-07 19:39:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-12-07 19:39:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 144. [2019-12-07 19:39:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 19:39:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2019-12-07 19:39:24,916 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 29 [2019-12-07 19:39:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:39:24,916 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2019-12-07 19:39:24,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 19:39:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2019-12-07 19:39:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:39:24,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:39:24,917 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] [2019-12-07 19:39:25,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:39:25,521 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 19:39:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:39:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1930359365, now seen corresponding path program 1 times [2019-12-07 19:39:25,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:39:25,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756200262] [2019-12-07 19:39:25,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 19:39:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:25,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:39:25,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:25,628 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:25,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756200262] [2019-12-07 19:39:25,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [985239126] [2019-12-07 19:39:25,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:39:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:25,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:39:25,804 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:25,806 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:25,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297412763] [2019-12-07 19:39:25,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:39:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:25,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:39:25,856 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:39:25,927 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:39:25,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 19:39:25,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [5, 5, 5, 5] total 15 [2019-12-07 19:39:25,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440378695] [2019-12-07 19:39:25,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:39:25,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:39:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:39:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:39:25,939 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand 9 states. [2019-12-07 19:39:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:39:26,519 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2019-12-07 19:39:26,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:39:26,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-12-07 19:39:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:39:26,520 INFO L225 Difference]: With dead ends: 172 [2019-12-07 19:39:26,520 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 19:39:26,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-07 19:39:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 19:39:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2019-12-07 19:39:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-12-07 19:39:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2019-12-07 19:39:26,523 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 32 [2019-12-07 19:39:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:39:26,523 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2019-12-07 19:39:26,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:39:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2019-12-07 19:39:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:39:26,524 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:39:26,525 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] [2019-12-07 19:39:27,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:39:27,128 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 19:39:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:39:27,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1930359366, now seen corresponding path program 1 times [2019-12-07 19:39:27,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:39:27,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195264666] [2019-12-07 19:39:27,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 19:39:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:27,262 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:39:27,263 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:27,272 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:27,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195264666] [2019-12-07 19:39:27,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2080866192] [2019-12-07 19:39:27,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:39:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:27,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:39:27,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:27,452 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:27,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477101230] [2019-12-07 19:39:27,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:39:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:27,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 19:39:27,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:27,509 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 19:39:27,509 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:27,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:27,513 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:39:27,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:39:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:39:27,627 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:39:28,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 19:39:28,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [5, 5, 5, 5] total 22 [2019-12-07 19:39:28,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235636992] [2019-12-07 19:39:28,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:39:28,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:39:28,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:39:28,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:39:28,306 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand 16 states. [2019-12-07 19:39:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:39:29,686 INFO L93 Difference]: Finished difference Result 190 states and 221 transitions. [2019-12-07 19:39:29,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:39:29,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-12-07 19:39:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:39:29,688 INFO L225 Difference]: With dead ends: 190 [2019-12-07 19:39:29,688 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 19:39:29,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2019-12-07 19:39:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 19:39:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2019-12-07 19:39:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-12-07 19:39:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 178 transitions. [2019-12-07 19:39:29,693 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 178 transitions. Word has length 32 [2019-12-07 19:39:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:39:29,693 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 178 transitions. [2019-12-07 19:39:29,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:39:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2019-12-07 19:39:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:39:29,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:39:29,694 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 19:39:30,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt --rewrite-divk,24 mathsat -unsat_core_generation=3 [2019-12-07 19:39:30,296 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 19:39:30,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:39:30,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1044547285, now seen corresponding path program 2 times [2019-12-07 19:39:30,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:39:30,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038874460] [2019-12-07 19:39:30,299 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 19:39:30,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:39:30,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:39:30,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:39:30,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:30,428 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:30,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038874460] [2019-12-07 19:39:30,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [698240354] [2019-12-07 19:39:30,480 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:39:30,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:39:30,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:39:30,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 19:39:30,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:30,628 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:30,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653834546] [2019-12-07 19:39:30,630 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:39:30,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 19:39:30,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 19:39:30,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 19:39:30,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:30,764 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 19:39:30,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:39:30,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 19:39:30,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496520681] [2019-12-07 19:39:30,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:39:30,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:39:30,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:39:30,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:39:30,964 INFO L87 Difference]: Start difference. First operand 150 states and 178 transitions. Second operand 16 states. [2019-12-07 19:39:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:39:32,004 INFO L93 Difference]: Finished difference Result 485 states and 540 transitions. [2019-12-07 19:39:32,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 19:39:32,005 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-12-07 19:39:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:39:32,006 INFO L225 Difference]: With dead ends: 485 [2019-12-07 19:39:32,006 INFO L226 Difference]: Without dead ends: 485 [2019-12-07 19:39:32,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 19:39:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-12-07 19:39:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 180. [2019-12-07 19:39:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 19:39:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 220 transitions. [2019-12-07 19:39:32,011 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 220 transitions. Word has length 32 [2019-12-07 19:39:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:39:32,011 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 220 transitions. [2019-12-07 19:39:32,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:39:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 220 transitions. [2019-12-07 19:39:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:39:32,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:39:32,012 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 19:39:32,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 mathsat -unsat_core_generation=3,28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:39:32,615 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 19:39:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:39:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash -987731250, now seen corresponding path program 1 times [2019-12-07 19:39:32,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:39:32,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519949215] [2019-12-07 19:39:32,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 19:39:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:32,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:39:32,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:39:32,741 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:39:32,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519949215] [2019-12-07 19:39:32,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [26819294] [2019-12-07 19:39:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:39:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:32,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:39:32,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:39:32,968 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 19:39:32,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450567982] [2019-12-07 19:39:32,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/bin/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:39:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:33,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 19:39:33,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 19:39:33,046 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:39:33,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 19:39:33,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 7, 9] total 17 [2019-12-07 19:39:33,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485116077] [2019-12-07 19:39:33,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 19:39:33,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:39:33,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 19:39:33,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-07 19:39:33,285 INFO L87 Difference]: Start difference. First operand 180 states and 220 transitions. Second operand 17 states. [2019-12-07 19:39:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:39:33,389 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2019-12-07 19:39:33,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:39:33,389 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-12-07 19:39:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:39:33,390 INFO L225 Difference]: With dead ends: 141 [2019-12-07 19:39:33,390 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 19:39:33,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 190 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:39:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 19:39:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 120. [2019-12-07 19:39:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 19:39:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2019-12-07 19:39:33,394 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 36 [2019-12-07 19:39:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:39:33,394 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2019-12-07 19:39:33,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 19:39:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2019-12-07 19:39:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 19:39:33,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:39:33,394 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 19:39:33,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 mathsat -unsat_core_generation=3,31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:39:33,996 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 19:39:33,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:39:33,997 INFO L82 PathProgramCache]: Analyzing trace with hash -589032909, now seen corresponding path program 1 times [2019-12-07 19:39:33,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:39:33,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14433367] [2019-12-07 19:39:33,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:39:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:34,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:39:34,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 19:39:34,127 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 19:39:34,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14433367] [2019-12-07 19:39:34,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:39:34,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 19:39:34,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455713400] [2019-12-07 19:39:34,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:39:34,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:39:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:39:34,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:39:34,137 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 6 states. [2019-12-07 19:39:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:39:34,173 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-12-07 19:39:34,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:39:34,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 19:39:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:39:34,174 INFO L225 Difference]: With dead ends: 117 [2019-12-07 19:39:34,174 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 19:39:34,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:39:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 19:39:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-12-07 19:39:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 19:39:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2019-12-07 19:39:34,176 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 38 [2019-12-07 19:39:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:39:34,176 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2019-12-07 19:39:34,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:39:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2019-12-07 19:39:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:39:34,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:39:34,177 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, 1] [2019-12-07 19:39:34,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 19:39:34,378 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 19:39:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:39:34,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1130721309, now seen corresponding path program 1 times [2019-12-07 19:39:34,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:39:34,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299214759] [2019-12-07 19:39:34,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:39:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:34,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 19:39:34,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:34,573 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 19:39:34,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:34,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:34,575 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:39:34,575 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:39:34,593 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:34,594 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 19:39:34,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:34,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:34,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:39:34,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2019-12-07 19:39:34,639 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 19:39:34,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:34,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:34,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:39:34,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 19:39:34,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:34,702 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 28 treesize of output 46 [2019-12-07 19:39:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:39:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:39:34,702 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 19:39:34,724 INFO L614 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2019-12-07 19:39:34,724 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 19:39:34,724 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-12-07 19:39:34,883 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_140|], 6=[|v_#memory_$Pointer$.base_163|]} [2019-12-07 19:39:34,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 19:39:34,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:34,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:34,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:39:43,025 WARN L192 SmtUtils]: Spent 8.11 s on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 19:39:43,025 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:43,026 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 71 [2019-12-07 19:39:43,026 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:43,060 INFO L614 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2019-12-07 19:39:43,060 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 19:39:43,061 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:32 [2019-12-07 19:39:43,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:43,188 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 27 treesize of output 26 [2019-12-07 19:39:43,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:43,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:43,196 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 19:39:43,196 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 [2019-12-07 19:39:43,298 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 23 treesize of output 22 [2019-12-07 19:39:43,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:43,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:43,312 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 19:39:43,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:13 [2019-12-07 19:39:43,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:39:43,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:43,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:43,454 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 19:39:43,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 19:39:43,573 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 19:39:43,574 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:39:44,595 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 112 treesize of output 106 [2019-12-07 19:39:44,595 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:39:44,757 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-07 19:39:44,758 INFO L614 ElimStorePlain]: treesize reduction 33, result has 68.0 percent of original size [2019-12-07 19:39:44,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:39:44,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:39:44,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:39:44,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:39:44,760 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 19:39:44,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:44,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:39:44,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:39:44,812 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 4 xjuncts. [2019-12-07 19:39:44,812 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:32 [2019-12-07 19:39:45,491 INFO L343 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2019-12-07 19:39:45,491 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 37 treesize of output 40 [2019-12-07 19:39:45,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:39:45,498 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:39:45,498 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 40 treesize of output 42 [2019-12-07 19:39:45,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:39:45,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:39:45,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:39:45,500 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_85], 2=[v_arrayElimCell_86]} [2019-12-07 19:39:45,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299214759] [2019-12-07 19:39:45,502 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@9b26f89 [2019-12-07 19:39:45,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1425745377] [2019-12-07 19:39:45,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:39:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:45,754 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-07 19:39:45,755 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:45,756 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@9b26f89 [2019-12-07 19:39:45,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729884974] [2019-12-07 19:39:45,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8a9a2254-eea8-46be-8db7-dfde9ded259c/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 19:39:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:39:45,814 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 19:39:45,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:39:45,816 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@9b26f89 [2019-12-07 19:39:45,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:39:45,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 19:39:45,816 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 19:39:45,816 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:39:46,420 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 19:39:46,458 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 19:39:46,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:39:46 BoogieIcfgContainer [2019-12-07 19:39:46,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:39:46,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:39:46,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:39:46,459 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:39:46,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:35:34" (3/4) ... [2019-12-07 19:39:46,463 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 19:39:46,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:39:46,464 INFO L168 Benchmark]: Toolchain (without parser) took 252780.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 948.4 MB in the beginning and 889.7 MB in the end (delta: 58.7 MB). Peak memory consumption was 258.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:39:46,464 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:39:46,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-12-07 19:39:46,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:39:46,465 INFO L168 Benchmark]: Boogie Preprocessor took 25.31 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 19:39:46,466 INFO L168 Benchmark]: RCFGBuilder took 401.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:39:46,466 INFO L168 Benchmark]: TraceAbstraction took 251941.51 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 889.7 MB in the end (delta: 172.5 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:39:46,466 INFO L168 Benchmark]: Witness Printer took 4.44 ms. Allocated memory is still 1.2 GB. Free memory is still 889.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:39:46,467 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -160.6 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.31 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 401.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 251941.51 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 889.7 MB in the end (delta: 172.5 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.44 ms. Allocated memory is still 1.2 GB. Free memory is still 889.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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 = 0 [L614] COND TRUE i < len [L615] int new_data = i + len; [L603] COND FALSE !(index > 0) [L607] head->data = data [L614] i++ [L614] COND TRUE i < len [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 FALSE !(i < len) [L618] i = 0 [L618] COND TRUE i < len [L619] int expected = i + len; [L596] COND FALSE !(index > 0) [L600] EXPR head->data [L600] return head->data; [L620] COND TRUE expected != sll_circular_get_data_at(s, i) [L626] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 86 locations, 32 error locations. Result: UNKNOWN, OverallTime: 251.8s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 140.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1081 SDtfs, 14930 SDslu, 4882 SDs, 0 SdLazy, 4574 SolverSat, 1053 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 38.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1744 GetRequests, 1300 SyntacticMatches, 53 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6513 ImplicationChecksByTransitivity, 128.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=16, 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, 18 MinimizatonAttempts, 1592 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 88.7s InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1564 ConstructedInterpolants, 164 QuantifiedInterpolants, 382934 SizeOfPredicates, 356 NumberOfNonLiveVariables, 3890 ConjunctsInSsa, 432 ConjunctsInUnsatCore, 64 InterpolantComputations, 26 PerfectInterpolantSequences, 228/380 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...