./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_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_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 fabf658906da38258bbb10e77b5550f740cea929 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 fabf658906da38258bbb10e77b5550f740cea929 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 21:51:41,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:51:41,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:51:41,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:51:41,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:51:41,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:51:41,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:51:41,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:51:41,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:51:41,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:51:41,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:51:41,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:51:41,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:51:41,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:51:41,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:51:41,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:51:41,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:51:41,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:51:41,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:51:41,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:51:41,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:51:41,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:51:41,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:51:41,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:51:41,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:51:41,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:51:41,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:51:41,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:51:41,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:51:41,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:51:41,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:51:41,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:51:41,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:51:41,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:51:41,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:51:41,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:51:41,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:51:41,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:51:41,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:51:41,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:51:41,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:51:41,241 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 21:51:41,251 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:51:41,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:51:41,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:51:41,252 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:51:41,252 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:51:41,253 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:51:41,253 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:51:41,253 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:51:41,253 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:51:41,253 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:51:41,253 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:51:41,253 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:51:41,253 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:51:41,254 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:51:41,254 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:51:41,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 21:51:41,254 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 21:51:41,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 21:51:41,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:51:41,256 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:51:41,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:51:41,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:51:41,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:51:41,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:51:41,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:51:41,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:51:41,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:51:41,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:51:41,257 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:51:41,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:51:41,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:51:41,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:51:41,257 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_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 -> fabf658906da38258bbb10e77b5550f740cea929 [2019-12-07 21:51:41,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:51:41,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:51:41,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:51:41,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:51:41,369 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:51:41,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2019-12-07 21:51:41,411 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data/407e3793e/961ed7d2b0ca40498e699fc1b624b1e9/FLAG93f86f286 [2019-12-07 21:51:41,771 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:51:41,772 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/sv-benchmarks/c/list-simple/dll2n_update_all.i [2019-12-07 21:51:41,780 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data/407e3793e/961ed7d2b0ca40498e699fc1b624b1e9/FLAG93f86f286 [2019-12-07 21:51:41,788 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data/407e3793e/961ed7d2b0ca40498e699fc1b624b1e9 [2019-12-07 21:51:41,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:51:41,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:51:41,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:51:41,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:51:41,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:51:41,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:51:41" (1/1) ... [2019-12-07 21:51:41,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e011e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:41, skipping insertion in model container [2019-12-07 21:51:41,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:51:41" (1/1) ... [2019-12-07 21:51:41,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:51:41,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:51:42,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:51:42,059 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:51:42,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:51:42,122 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:51:42,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42 WrapperNode [2019-12-07 21:51:42,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:51:42,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:51:42,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:51:42,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:51:42,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:51:42,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:51:42,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:51:42,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:51:42,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... [2019-12-07 21:51:42,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:51:42,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:51:42,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:51:42,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:51:42,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:51:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 21:51:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:51:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 21:51:42,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 21:51:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 21:51:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:51:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:51:42,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:51:42,504 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:51:42,504 INFO L287 CfgBuilder]: Removed 20 assume(true) statements. [2019-12-07 21:51:42,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:51:42 BoogieIcfgContainer [2019-12-07 21:51:42,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:51:42,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:51:42,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:51:42,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:51:42,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:51:41" (1/3) ... [2019-12-07 21:51:42,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:51:42, skipping insertion in model container [2019-12-07 21:51:42,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:51:42" (2/3) ... [2019-12-07 21:51:42,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:51:42, skipping insertion in model container [2019-12-07 21:51:42,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:51:42" (3/3) ... [2019-12-07 21:51:42,510 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2019-12-07 21:51:42,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:51:42,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 21:51:42,528 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 21:51:42,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:51:42,540 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 21:51:42,541 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:51:42,541 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:51:42,541 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:51:42,541 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:51:42,541 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:51:42,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:51:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-12-07 21:51:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 21:51:42,556 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:42,557 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 21:51:42,557 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash 5403289, now seen corresponding path program 1 times [2019-12-07 21:51:42,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:42,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961312083] [2019-12-07 21:51:42,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:42,665 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 21:51:42,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961312083] [2019-12-07 21:51:42,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:42,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:51:42,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690090260] [2019-12-07 21:51:42,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:51:42,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:42,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:51:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:51:42,680 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-12-07 21:51:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:42,741 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-12-07 21:51:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:51:42,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 21:51:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:42,749 INFO L225 Difference]: With dead ends: 80 [2019-12-07 21:51:42,749 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 21:51:42,750 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 21:51:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 21:51:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 45. [2019-12-07 21:51:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 21:51:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-12-07 21:51:42,774 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 4 [2019-12-07 21:51:42,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:42,774 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-12-07 21:51:42,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:51:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-12-07 21:51:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 21:51:42,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:42,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 21:51:42,775 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:42,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:42,775 INFO L82 PathProgramCache]: Analyzing trace with hash 5403290, now seen corresponding path program 1 times [2019-12-07 21:51:42,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:42,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722440196] [2019-12-07 21:51:42,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:42,811 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 21:51:42,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722440196] [2019-12-07 21:51:42,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:42,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:51:42,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844494797] [2019-12-07 21:51:42,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:51:42,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:42,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:51:42,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:51:42,814 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 3 states. [2019-12-07 21:51:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:42,860 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-12-07 21:51:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:51:42,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 21:51:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:42,862 INFO L225 Difference]: With dead ends: 74 [2019-12-07 21:51:42,862 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 21:51:42,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 21:51:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 21:51:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2019-12-07 21:51:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 21:51:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-12-07 21:51:42,868 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 4 [2019-12-07 21:51:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:42,868 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-12-07 21:51:42,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:51:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-12-07 21:51:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:51:42,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:42,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:51:42,869 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash 172007816, now seen corresponding path program 1 times [2019-12-07 21:51:42,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:42,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574193844] [2019-12-07 21:51:42,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:42,886 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 21:51:42,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574193844] [2019-12-07 21:51:42,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:42,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:51:42,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093864542] [2019-12-07 21:51:42,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:51:42,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:42,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:51:42,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:51:42,887 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 3 states. [2019-12-07 21:51:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:42,895 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-12-07 21:51:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:51:42,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 21:51:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:42,896 INFO L225 Difference]: With dead ends: 52 [2019-12-07 21:51:42,896 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 21:51:42,896 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 21:51:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 21:51:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-12-07 21:51:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 21:51:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-12-07 21:51:42,900 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 5 [2019-12-07 21:51:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:42,900 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-12-07 21:51:42,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:51:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-12-07 21:51:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 21:51:42,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:42,901 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:42,901 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:42,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:42,901 INFO L82 PathProgramCache]: Analyzing trace with hash -701380515, now seen corresponding path program 1 times [2019-12-07 21:51:42,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:42,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654711752] [2019-12-07 21:51:42,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:42,938 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 21:51:42,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654711752] [2019-12-07 21:51:42,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:42,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:51:42,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108364832] [2019-12-07 21:51:42,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:51:42,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:51:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:51:42,939 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-12-07 21:51:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:42,955 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-12-07 21:51:42,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:51:42,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 21:51:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:42,956 INFO L225 Difference]: With dead ends: 49 [2019-12-07 21:51:42,956 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 21:51:42,957 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 21:51:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 21:51:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-12-07 21:51:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 21:51:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2019-12-07 21:51:42,961 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 8 [2019-12-07 21:51:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:42,961 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2019-12-07 21:51:42,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:51:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2019-12-07 21:51:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 21:51:42,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:42,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:42,962 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1715799504, now seen corresponding path program 1 times [2019-12-07 21:51:42,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:42,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291087907] [2019-12-07 21:51:42,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:42,995 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 21:51:42,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291087907] [2019-12-07 21:51:42,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494867972] [2019-12-07 21:51:42,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:51:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:43,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:51:43,045 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:51:43,066 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 21:51:43,066 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:51:43,074 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 21:51:43,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1541018521] [2019-12-07 21:51:43,089 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-12-07 21:51:43,089 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:51:43,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:51:43,097 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:51:43,097 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:51:43,200 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:43,397 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:43,935 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:44,431 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:51:44,742 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2019-12-07 21:51:45,110 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-12-07 21:51:45,262 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-07 21:51:45,590 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 92 [2019-12-07 21:51:46,037 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-12-07 21:51:46,638 WARN L192 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 97 [2019-12-07 21:51:47,062 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 70 [2019-12-07 21:51:47,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:51:47,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 11 [2019-12-07 21:51:47,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358759677] [2019-12-07 21:51:47,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:51:47,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:51:47,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:51:47,065 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2019-12-07 21:51:47,459 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-12-07 21:51:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:47,654 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-12-07 21:51:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:51:47,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-07 21:51:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:47,656 INFO L225 Difference]: With dead ends: 59 [2019-12-07 21:51:47,656 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 21:51:47,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:51:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 21:51:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-12-07 21:51:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 21:51:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-12-07 21:51:47,660 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 12 [2019-12-07 21:51:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:47,660 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-12-07 21:51:47,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:51:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-12-07 21:51:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:51:47,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:47,661 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-12-07 21:51:47,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:51:47,862 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:47,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash -113008875, now seen corresponding path program 1 times [2019-12-07 21:51:47,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:47,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448137708] [2019-12-07 21:51:47,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:51:47,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448137708] [2019-12-07 21:51:47,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521931713] [2019-12-07 21:51:47,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:51:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:47,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:51:47,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:51:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:51:47,996 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:51:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:51:48,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2144310321] [2019-12-07 21:51:48,015 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2019-12-07 21:51:48,015 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:51:48,015 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:51:48,015 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:51:48,015 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:51:48,043 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:48,182 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:48,574 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:49,016 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:51:49,314 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2019-12-07 21:51:49,712 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2019-12-07 21:51:50,214 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-12-07 21:51:51,259 WARN L192 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-12-07 21:51:51,748 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 21:51:52,304 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 97 [2019-12-07 21:51:52,593 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 70 [2019-12-07 21:51:52,981 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91 [2019-12-07 21:51:52,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:51:52,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 4, 4] total 14 [2019-12-07 21:51:52,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344515251] [2019-12-07 21:51:52,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:51:52,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:52,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:51:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:51:52,982 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 10 states. [2019-12-07 21:51:53,276 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-12-07 21:51:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:53,561 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-12-07 21:51:53,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:51:53,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-07 21:51:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:53,563 INFO L225 Difference]: With dead ends: 57 [2019-12-07 21:51:53,564 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 21:51:53,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-12-07 21:51:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 21:51:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-12-07 21:51:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 21:51:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-12-07 21:51:53,569 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 15 [2019-12-07 21:51:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:53,569 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-12-07 21:51:53,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:51:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-12-07 21:51:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:51:53,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:53,571 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:53,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:51:53,772 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:53,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:53,773 INFO L82 PathProgramCache]: Analyzing trace with hash -811854236, now seen corresponding path program 1 times [2019-12-07 21:51:53,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:53,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002263896] [2019-12-07 21:51:53,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:51:53,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002263896] [2019-12-07 21:51:53,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:53,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:51:53,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255907399] [2019-12-07 21:51:53,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:51:53,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:51:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:51:53,843 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 6 states. [2019-12-07 21:51:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:53,946 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2019-12-07 21:51:53,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:51:53,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 21:51:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:53,948 INFO L225 Difference]: With dead ends: 97 [2019-12-07 21:51:53,948 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 21:51:53,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:51:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 21:51:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2019-12-07 21:51:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 21:51:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-12-07 21:51:53,951 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 20 [2019-12-07 21:51:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:53,952 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-12-07 21:51:53,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:51:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-12-07 21:51:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:51:53,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:53,952 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:53,953 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:53,953 INFO L82 PathProgramCache]: Analyzing trace with hash -811854235, now seen corresponding path program 1 times [2019-12-07 21:51:53,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:53,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714041367] [2019-12-07 21:51:53,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:51:53,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714041367] [2019-12-07 21:51:53,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:53,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:51:53,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585879243] [2019-12-07 21:51:53,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:51:53,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:53,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:51:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:51:53,998 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 6 states. [2019-12-07 21:51:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:54,097 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2019-12-07 21:51:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:51:54,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 21:51:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:54,097 INFO L225 Difference]: With dead ends: 82 [2019-12-07 21:51:54,098 INFO L226 Difference]: Without dead ends: 82 [2019-12-07 21:51:54,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:51:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-07 21:51:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2019-12-07 21:51:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 21:51:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2019-12-07 21:51:54,101 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 20 [2019-12-07 21:51:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:54,101 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2019-12-07 21:51:54,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:51:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2019-12-07 21:51:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:51:54,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:54,102 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:54,103 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:54,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:54,103 INFO L82 PathProgramCache]: Analyzing trace with hash 605586212, now seen corresponding path program 1 times [2019-12-07 21:51:54,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:54,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096281802] [2019-12-07 21:51:54,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:51:54,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096281802] [2019-12-07 21:51:54,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:54,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:51:54,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145546820] [2019-12-07 21:51:54,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:51:54,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:51:54,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:51:54,142 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2019-12-07 21:51:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:54,246 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2019-12-07 21:51:54,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:51:54,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 21:51:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:54,247 INFO L225 Difference]: With dead ends: 87 [2019-12-07 21:51:54,247 INFO L226 Difference]: Without dead ends: 87 [2019-12-07 21:51:54,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:51:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-07 21:51:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2019-12-07 21:51:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 21:51:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-12-07 21:51:54,250 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 21 [2019-12-07 21:51:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:54,250 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-12-07 21:51:54,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:51:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-12-07 21:51:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:51:54,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:54,251 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:54,251 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 605586213, now seen corresponding path program 1 times [2019-12-07 21:51:54,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:54,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925081126] [2019-12-07 21:51:54,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:51:54,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925081126] [2019-12-07 21:51:54,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:54,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:51:54,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946280999] [2019-12-07 21:51:54,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:51:54,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:51:54,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:51:54,304 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 6 states. [2019-12-07 21:51:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:54,401 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-12-07 21:51:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:51:54,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 21:51:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:54,402 INFO L225 Difference]: With dead ends: 76 [2019-12-07 21:51:54,402 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 21:51:54,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:51:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 21:51:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-12-07 21:51:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 21:51:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-12-07 21:51:54,404 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 21 [2019-12-07 21:51:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:54,405 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-12-07 21:51:54,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:51:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-12-07 21:51:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:51:54,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:54,405 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:54,405 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash 605665181, now seen corresponding path program 1 times [2019-12-07 21:51:54,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:54,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527019660] [2019-12-07 21:51:54,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:51:54,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527019660] [2019-12-07 21:51:54,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:54,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:51:54,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102011334] [2019-12-07 21:51:54,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:51:54,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:54,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:51:54,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:51:54,436 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 7 states. [2019-12-07 21:51:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:54,502 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-12-07 21:51:54,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:51:54,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 21:51:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:54,503 INFO L225 Difference]: With dead ends: 68 [2019-12-07 21:51:54,503 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 21:51:54,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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 21:51:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 21:51:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2019-12-07 21:51:54,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 21:51:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2019-12-07 21:51:54,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2019-12-07 21:51:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:54,505 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-12-07 21:51:54,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:51:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2019-12-07 21:51:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:51:54,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:54,506 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:54,506 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 605663862, now seen corresponding path program 1 times [2019-12-07 21:51:54,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:54,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781651125] [2019-12-07 21:51:54,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:51:54,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781651125] [2019-12-07 21:51:54,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:54,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:51:54,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091594221] [2019-12-07 21:51:54,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:51:54,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:51:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:51:54,534 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 6 states. [2019-12-07 21:51:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:54,614 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2019-12-07 21:51:54,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:51:54,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 21:51:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:54,615 INFO L225 Difference]: With dead ends: 61 [2019-12-07 21:51:54,615 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 21:51:54,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:51:54,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 21:51:54,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2019-12-07 21:51:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 21:51:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-12-07 21:51:54,617 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 21 [2019-12-07 21:51:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:54,617 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-12-07 21:51:54,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:51:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-12-07 21:51:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:51:54,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:54,618 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:54,618 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:54,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:54,619 INFO L82 PathProgramCache]: Analyzing trace with hash 605663863, now seen corresponding path program 1 times [2019-12-07 21:51:54,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:54,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647143983] [2019-12-07 21:51:54,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:51:54,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647143983] [2019-12-07 21:51:54,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:54,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:51:54,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944961662] [2019-12-07 21:51:54,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:51:54,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:51:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:51:54,663 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2019-12-07 21:51:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:54,757 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-12-07 21:51:54,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:51:54,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 21:51:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:54,757 INFO L225 Difference]: With dead ends: 59 [2019-12-07 21:51:54,758 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 21:51:54,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:51:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 21:51:54,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-12-07 21:51:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 21:51:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-12-07 21:51:54,759 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 21 [2019-12-07 21:51:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:54,760 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-12-07 21:51:54,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:51:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-12-07 21:51:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:51:54,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:54,760 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:54,760 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1489120455, now seen corresponding path program 1 times [2019-12-07 21:51:54,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:54,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632318208] [2019-12-07 21:51:54,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:54,779 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 21:51:54,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632318208] [2019-12-07 21:51:54,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:51:54,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:51:54,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712827648] [2019-12-07 21:51:54,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:51:54,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:51:54,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:51:54,780 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2019-12-07 21:51:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:54,805 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2019-12-07 21:51:54,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:51:54,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 21:51:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:54,806 INFO L225 Difference]: With dead ends: 144 [2019-12-07 21:51:54,806 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 21:51:54,806 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 21:51:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 21:51:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 58. [2019-12-07 21:51:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 21:51:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-12-07 21:51:54,808 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 22 [2019-12-07 21:51:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:54,808 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-12-07 21:51:54,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:51:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-12-07 21:51:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:51:54,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:54,809 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:54,809 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:54,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2147147077, now seen corresponding path program 1 times [2019-12-07 21:51:54,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:54,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510671519] [2019-12-07 21:51:54,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:51:54,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510671519] [2019-12-07 21:51:54,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769221730] [2019-12-07 21:51:54,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:51:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:54,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:51:54,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:51:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:51:54,887 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:51:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:51:54,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:51:54,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 7 [2019-12-07 21:51:54,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569844017] [2019-12-07 21:51:54,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:51:54,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:51:54,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:51:54,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:51:54,897 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2019-12-07 21:51:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:51:54,924 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-12-07 21:51:54,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:51:54,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-07 21:51:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:51:54,925 INFO L225 Difference]: With dead ends: 75 [2019-12-07 21:51:54,925 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 21:51:54,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:51:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 21:51:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2019-12-07 21:51:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 21:51:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2019-12-07 21:51:54,927 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 23 [2019-12-07 21:51:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:51:54,928 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2019-12-07 21:51:54,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:51:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2019-12-07 21:51:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:51:54,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:51:54,929 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:51:55,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:51:55,129 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:51:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:51:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1471472032, now seen corresponding path program 1 times [2019-12-07 21:51:55,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:51:55,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613460538] [2019-12-07 21:51:55,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:51:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:51:55,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613460538] [2019-12-07 21:51:55,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465219528] [2019-12-07 21:51:55,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:51:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:51:55,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 21:51:55,356 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:51:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:51:55,718 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:51:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:51:55,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [861644846] [2019-12-07 21:51:55,942 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 21:51:55,942 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:51:55,943 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:51:55,943 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:51:55,943 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:51:55,971 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:56,104 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:56,656 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:56,690 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:56,712 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:56,728 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:51:57,673 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:51:57,818 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-07 21:51:58,435 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 90 [2019-12-07 21:51:59,061 WARN L192 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 94 [2019-12-07 21:51:59,749 WARN L192 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 99 [2019-12-07 21:52:00,457 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2019-12-07 21:52:00,950 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 93 [2019-12-07 21:52:01,369 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-07 21:52:01,450 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:52:01,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:52:01,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 8] total 26 [2019-12-07 21:52:01,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824058605] [2019-12-07 21:52:01,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 21:52:01,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:52:01,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 21:52:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1232, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 21:52:01,454 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 27 states. [2019-12-07 21:52:02,561 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-12-07 21:52:03,015 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-12-07 21:52:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:03,960 INFO L93 Difference]: Finished difference Result 202 states and 256 transitions. [2019-12-07 21:52:03,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 21:52:03,961 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 25 [2019-12-07 21:52:03,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:03,963 INFO L225 Difference]: With dead ends: 202 [2019-12-07 21:52:03,963 INFO L226 Difference]: Without dead ends: 202 [2019-12-07 21:52:03,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=546, Invalid=3114, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 21:52:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-12-07 21:52:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 82. [2019-12-07 21:52:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 21:52:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2019-12-07 21:52:03,970 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 25 [2019-12-07 21:52:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:03,970 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2019-12-07 21:52:03,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 21:52:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2019-12-07 21:52:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:52:03,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:03,971 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:04,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:04,172 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1471472033, now seen corresponding path program 1 times [2019-12-07 21:52:04,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:52:04,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938483086] [2019-12-07 21:52:04,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:52:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:04,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938483086] [2019-12-07 21:52:04,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103032337] [2019-12-07 21:52:04,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:04,502 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-07 21:52:04,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:05,327 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:06,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:06,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [821333223] [2019-12-07 21:52:06,375 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 21:52:06,376 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:52:06,376 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:52:06,376 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:52:06,376 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:52:06,400 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:06,520 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:07,049 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:07,079 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:07,100 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:07,132 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:08,090 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:52:08,261 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-12-07 21:52:08,929 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2019-12-07 21:52:09,494 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-12-07 21:52:10,183 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-12-07 21:52:10,915 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 99 [2019-12-07 21:52:11,509 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 93 [2019-12-07 21:52:11,891 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:52:11,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:52:11,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 33 [2019-12-07 21:52:11,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625393082] [2019-12-07 21:52:11,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 21:52:11,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:52:11,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 21:52:11,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1754, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 21:52:11,893 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand 34 states. [2019-12-07 21:52:12,708 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-12-07 21:52:13,073 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 102 [2019-12-07 21:52:13,644 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 108 [2019-12-07 21:52:13,939 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-12-07 21:52:14,205 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-12-07 21:52:14,593 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 102 [2019-12-07 21:52:15,269 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 96 [2019-12-07 21:52:15,501 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2019-12-07 21:52:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:15,595 INFO L93 Difference]: Finished difference Result 196 states and 244 transitions. [2019-12-07 21:52:15,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 21:52:15,595 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 25 [2019-12-07 21:52:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:15,597 INFO L225 Difference]: With dead ends: 196 [2019-12-07 21:52:15,597 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 21:52:15,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=648, Invalid=3512, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 21:52:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 21:52:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 86. [2019-12-07 21:52:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 21:52:15,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2019-12-07 21:52:15,604 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 25 [2019-12-07 21:52:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:15,604 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2019-12-07 21:52:15,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 21:52:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2019-12-07 21:52:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 21:52:15,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:15,606 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:15,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:15,807 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1037375747, now seen corresponding path program 2 times [2019-12-07 21:52:15,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:52:15,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48098064] [2019-12-07 21:52:15,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:52:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:52:15,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48098064] [2019-12-07 21:52:15,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090656183] [2019-12-07 21:52:15,848 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:15,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 21:52:15,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:52:15,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:52:15,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:52:15,909 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:52:15,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1628853697] [2019-12-07 21:52:15,920 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 21:52:15,920 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:52:15,920 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:52:15,921 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:52:15,921 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:52:15,946 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:16,054 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:16,524 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:16,594 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:16,615 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:16,642 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:17,563 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:52:17,684 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-07 21:52:18,168 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-12-07 21:52:18,653 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2019-12-07 21:52:19,203 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-12-07 21:52:19,779 WARN L192 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 107 [2019-12-07 21:52:20,190 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 93 [2019-12-07 21:52:20,412 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-07 21:52:20,426 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:52:20,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:52:20,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 8 [2019-12-07 21:52:20,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264246809] [2019-12-07 21:52:20,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:52:20,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:52:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:52:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-12-07 21:52:20,427 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand 8 states. [2019-12-07 21:52:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:20,493 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-12-07 21:52:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:52:20,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 21:52:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:20,494 INFO L225 Difference]: With dead ends: 81 [2019-12-07 21:52:20,494 INFO L226 Difference]: Without dead ends: 81 [2019-12-07 21:52:20,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2019-12-07 21:52:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-07 21:52:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2019-12-07 21:52:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 21:52:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-12-07 21:52:20,495 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 27 [2019-12-07 21:52:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:20,496 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-12-07 21:52:20,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:52:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-12-07 21:52:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 21:52:20,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:20,496 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:20,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:20,697 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:20,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1982617253, now seen corresponding path program 1 times [2019-12-07 21:52:20,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:52:20,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991802670] [2019-12-07 21:52:20,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:52:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:52:20,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991802670] [2019-12-07 21:52:20,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989219778] [2019-12-07 21:52:20,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:20,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:52:20,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:52:20,825 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:52:20,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1131754118] [2019-12-07 21:52:20,842 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-12-07 21:52:20,842 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:52:20,842 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:52:20,842 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:52:20,842 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:52:20,870 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:20,968 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:21,429 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:21,493 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:21,513 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:21,527 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 21:52:22,275 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:52:22,792 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 92 [2019-12-07 21:52:23,288 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 21:52:23,840 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 99 [2019-12-07 21:52:24,440 WARN L192 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 107 [2019-12-07 21:52:24,971 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 21:52:25,360 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-12-07 21:52:25,734 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2019-12-07 21:52:25,956 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-12-07 21:52:25,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:52:25,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 5, 5] total 20 [2019-12-07 21:52:25,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742476342] [2019-12-07 21:52:25,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:52:25,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:52:25,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:52:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-07 21:52:25,958 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 12 states. [2019-12-07 21:52:26,562 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2019-12-07 21:52:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:26,971 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-12-07 21:52:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:52:26,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-12-07 21:52:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:26,974 INFO L225 Difference]: With dead ends: 75 [2019-12-07 21:52:26,974 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 21:52:26,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:52:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 21:52:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-12-07 21:52:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 21:52:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-12-07 21:52:26,980 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 29 [2019-12-07 21:52:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:26,980 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-12-07 21:52:26,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:52:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-12-07 21:52:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 21:52:26,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:26,982 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:27,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:27,183 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1819506494, now seen corresponding path program 1 times [2019-12-07 21:52:27,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:52:27,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049400413] [2019-12-07 21:52:27,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:52:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:27,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049400413] [2019-12-07 21:52:27,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644751705] [2019-12-07 21:52:27,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:27,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 74 conjunts are in the unsatisfiable core [2019-12-07 21:52:27,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:28,291 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:28,807 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-07 21:52:29,293 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@155e8f19 [2019-12-07 21:52:29,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1230636745] [2019-12-07 21:52:29,294 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 21:52:29,294 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:52:29,295 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:52:29,295 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:52:29,295 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:52:29,303 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@155e8f19 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 21:52:29,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:52:29,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-12-07 21:52:29,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988272299] [2019-12-07 21:52:29,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 21:52:29,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:52:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 21:52:29,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1987, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 21:52:29,306 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 19 states. [2019-12-07 21:52:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 21:52:29,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:29,508 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@155e8f19 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 21:52:29,514 INFO L168 Benchmark]: Toolchain (without parser) took 47722.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.4 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 288.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:52:29,514 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:52:29,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:52:29,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.04 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 21:52:29,514 INFO L168 Benchmark]: Boogie Preprocessor took 20.52 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 21:52:29,514 INFO L168 Benchmark]: RCFGBuilder took 328.84 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:52:29,515 INFO L168 Benchmark]: TraceAbstraction took 47006.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.4 MB). Peak memory consumption was 282.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:52:29,515 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.04 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 20.52 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 328.84 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47006.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 325.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.4 MB). Peak memory consumption was 282.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@155e8f19 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@155e8f19: 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 21:52:30,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:52:30,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:52:30,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:52:30,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:52:30,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:52:30,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:52:30,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:52:30,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:52:30,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:52:30,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:52:30,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:52:30,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:52:30,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:52:30,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:52:30,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:52:30,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:52:30,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:52:30,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:52:30,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:52:30,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:52:30,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:52:30,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:52:30,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:52:30,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:52:30,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:52:30,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:52:30,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:52:30,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:52:30,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:52:30,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:52:30,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:52:30,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:52:30,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:52:30,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:52:30,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:52:30,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:52:30,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:52:30,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:52:30,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:52:30,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:52:30,891 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 21:52:30,900 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:52:30,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:52:30,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:52:30,901 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:52:30,901 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:52:30,902 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:52:30,902 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:52:30,902 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:52:30,902 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:52:30,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 21:52:30,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 21:52:30,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:52:30,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:52:30,903 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 21:52:30,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:52:30,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:52:30,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:52:30,903 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 21:52:30,904 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 21:52:30,904 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 21:52:30,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:52:30,904 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:52:30,904 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 21:52:30,904 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 21:52:30,904 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:52:30,904 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:52:30,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:52:30,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 21:52:30,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:52:30,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:52:30,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:52:30,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:52:30,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:52:30,905 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 21:52:30,906 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 21:52:30,906 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:52:30,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:52:30,906 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_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 -> fabf658906da38258bbb10e77b5550f740cea929 [2019-12-07 21:52:31,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:52:31,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:52:31,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:52:31,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:52:31,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:52:31,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2019-12-07 21:52:31,146 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data/9d8e6d5e9/0a510b2ee9fb4dac9046fdadd32a6e02/FLAG5c83f476e [2019-12-07 21:52:31,514 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:52:31,514 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/sv-benchmarks/c/list-simple/dll2n_update_all.i [2019-12-07 21:52:31,523 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data/9d8e6d5e9/0a510b2ee9fb4dac9046fdadd32a6e02/FLAG5c83f476e [2019-12-07 21:52:31,531 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/data/9d8e6d5e9/0a510b2ee9fb4dac9046fdadd32a6e02 [2019-12-07 21:52:31,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:52:31,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:52:31,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:52:31,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:52:31,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:52:31,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3004c47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31, skipping insertion in model container [2019-12-07 21:52:31,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:52:31,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:52:31,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:52:31,789 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:52:31,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:52:31,864 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:52:31,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31 WrapperNode [2019-12-07 21:52:31,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:52:31,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:52:31,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:52:31,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:52:31,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:52:31,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:52:31,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:52:31,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:52:31,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... [2019-12-07 21:52:31,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:52:31,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:52:31,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:52:31,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:52:31,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 21:52:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 21:52:31,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 21:52:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 21:52:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:52:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 21:52:31,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:52:31,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:52:32,276 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:52:32,277 INFO L287 CfgBuilder]: Removed 20 assume(true) statements. [2019-12-07 21:52:32,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:52:32 BoogieIcfgContainer [2019-12-07 21:52:32,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:52:32,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:52:32,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:52:32,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:52:32,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:52:31" (1/3) ... [2019-12-07 21:52:32,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27464984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:52:32, skipping insertion in model container [2019-12-07 21:52:32,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:52:31" (2/3) ... [2019-12-07 21:52:32,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27464984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:52:32, skipping insertion in model container [2019-12-07 21:52:32,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:52:32" (3/3) ... [2019-12-07 21:52:32,285 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2019-12-07 21:52:32,292 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:52:32,297 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 21:52:32,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 21:52:32,318 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:52:32,318 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 21:52:32,318 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:52:32,318 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:52:32,318 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:52:32,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:52:32,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:52:32,319 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:52:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-12-07 21:52:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:52:32,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:32,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:52:32,337 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:32,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash 28699851, now seen corresponding path program 1 times [2019-12-07 21:52:32,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:32,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407088684] [2019-12-07 21:52:32,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:32,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:52:32,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:32,433 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 21:52:32,433 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:32,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:32,440 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:32,440 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:52:32,447 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 21:52:32,448 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:32,451 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 21:52:32,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407088684] [2019-12-07 21:52:32,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:32,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 21:52:32,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101587175] [2019-12-07 21:52:32,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:52:32,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:32,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:52:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:52:32,473 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2019-12-07 21:52:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:32,598 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2019-12-07 21:52:32,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:52:32,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 21:52:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:32,606 INFO L225 Difference]: With dead ends: 107 [2019-12-07 21:52:32,607 INFO L226 Difference]: Without dead ends: 102 [2019-12-07 21:52:32,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 21:52:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-07 21:52:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 58. [2019-12-07 21:52:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 21:52:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2019-12-07 21:52:32,633 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 5 [2019-12-07 21:52:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:32,633 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2019-12-07 21:52:32,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:52:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2019-12-07 21:52:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:52:32,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:32,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:52:32,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 21:52:32,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash 28699852, now seen corresponding path program 1 times [2019-12-07 21:52:32,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:32,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989345019] [2019-12-07 21:52:32,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:32,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:52:32,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:32,937 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 21:52:32,937 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:32,942 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:32,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:32,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 21:52:32,951 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 21:52:32,951 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:32,988 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 21:52:32,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989345019] [2019-12-07 21:52:32,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:32,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 21:52:32,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011984426] [2019-12-07 21:52:32,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:52:32,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:32,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:52:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:52:32,991 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 4 states. [2019-12-07 21:52:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:33,128 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-12-07 21:52:33,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:52:33,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-12-07 21:52:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:33,130 INFO L225 Difference]: With dead ends: 99 [2019-12-07 21:52:33,130 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 21:52:33,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 21:52:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 21:52:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 55. [2019-12-07 21:52:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 21:52:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2019-12-07 21:52:33,136 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 5 [2019-12-07 21:52:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:33,137 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2019-12-07 21:52:33,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:52:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2019-12-07 21:52:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 21:52:33,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:33,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:33,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 21:52:33,338 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:33,339 INFO L82 PathProgramCache]: Analyzing trace with hash 264411510, now seen corresponding path program 1 times [2019-12-07 21:52:33,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:33,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112025822] [2019-12-07 21:52:33,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:33,395 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:52:33,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:33,401 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 21:52:33,401 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:33,407 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 21:52:33,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112025822] [2019-12-07 21:52:33,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:33,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 21:52:33,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463172261] [2019-12-07 21:52:33,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:52:33,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:33,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:52:33,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:52:33,409 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 4 states. [2019-12-07 21:52:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:33,424 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2019-12-07 21:52:33,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:52:33,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 21:52:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:33,425 INFO L225 Difference]: With dead ends: 66 [2019-12-07 21:52:33,425 INFO L226 Difference]: Without dead ends: 66 [2019-12-07 21:52:33,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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 21:52:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-07 21:52:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-12-07 21:52:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 21:52:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-12-07 21:52:33,430 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 8 [2019-12-07 21:52:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:33,431 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-12-07 21:52:33,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:52:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-12-07 21:52:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:52:33,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:33,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:33,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 21:52:33,633 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:33,634 INFO L82 PathProgramCache]: Analyzing trace with hash 671668623, now seen corresponding path program 1 times [2019-12-07 21:52:33,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:33,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336676644] [2019-12-07 21:52:33,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:33,734 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:52:33,735 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:33,742 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 21:52:33,742 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:33,744 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 21:52:33,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336676644] [2019-12-07 21:52:33,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:33,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 21:52:33,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168368587] [2019-12-07 21:52:33,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:52:33,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:33,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:52:33,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:52:33,745 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 3 states. [2019-12-07 21:52:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:33,773 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2019-12-07 21:52:33,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:52:33,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:52:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:33,775 INFO L225 Difference]: With dead ends: 64 [2019-12-07 21:52:33,775 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 21:52:33,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 21:52:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 21:52:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-12-07 21:52:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 21:52:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-12-07 21:52:33,780 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 9 [2019-12-07 21:52:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:33,781 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-12-07 21:52:33,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:52:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-12-07 21:52:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:52:33,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:33,781 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:33,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 21:52:33,982 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:33,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1971466659, now seen corresponding path program 1 times [2019-12-07 21:52:33,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:33,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149844301] [2019-12-07 21:52:33,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:34,056 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:52:34,057 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:34,062 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 21:52:34,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:34,064 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,065 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:52:34,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:34,088 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 14 treesize of output 30 [2019-12-07 21:52:34,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,101 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 21:52:34,102 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 21:52:34,102 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 21:52:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:34,112 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:34,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149844301] [2019-12-07 21:52:34,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [541575397] [2019-12-07 21:52:34,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:52:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:34,235 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 21:52:34,236 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:34,240 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 21:52:34,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:34,242 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,242 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:52:34,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:34,257 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 14 treesize of output 30 [2019-12-07 21:52:34,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,273 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-12-07 21:52:34,274 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 21:52:34,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-07 21:52:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:34,281 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:34,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896340077] [2019-12-07 21:52:34,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:34,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:52:34,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:34,369 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 21:52:34,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:34,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:52:34,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:34,393 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 21:52:34,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:34,408 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 21:52:34,409 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 21:52:34,409 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-12-07 21:52:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:34,432 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:34,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:52:34,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 4, 4] total 6 [2019-12-07 21:52:34,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554604176] [2019-12-07 21:52:34,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:52:34,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:34,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:52:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:52:34,463 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 7 states. [2019-12-07 21:52:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:34,637 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-12-07 21:52:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:52:34,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 21:52:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:34,638 INFO L225 Difference]: With dead ends: 76 [2019-12-07 21:52:34,638 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 21:52:34,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:52:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 21:52:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2019-12-07 21:52:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 21:52:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-12-07 21:52:34,642 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2019-12-07 21:52:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:34,642 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-12-07 21:52:34,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:52:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-12-07 21:52:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:52:34,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:34,643 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:35,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:35,245 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1971466660, now seen corresponding path program 1 times [2019-12-07 21:52:35,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:35,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687292717] [2019-12-07 21:52:35,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 21:52:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:35,316 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:52:35,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:35,323 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 21:52:35,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,333 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 21:52:35,333 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,340 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 21:52:35,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:52:35,370 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 12 treesize of output 14 [2019-12-07 21:52:35,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,390 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,391 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 21:52:35,391 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,401 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 21:52:35,402 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 21:52:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:35,425 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:35,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687292717] [2019-12-07 21:52:35,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [57572105] [2019-12-07 21:52:35,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:52:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:35,750 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:52:35,751 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:35,756 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 21:52:35,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,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 21:52:35,765 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,771 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,771 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 21:52:35,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,783 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 21:52:35,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,794 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 12 treesize of output 14 [2019-12-07 21:52:35,794 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,802 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 21:52:35,802 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 21:52:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:35,807 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:35,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832557163] [2019-12-07 21:52:35,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:35,940 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:52:35,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:35,947 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 21:52:35,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,955 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 21:52:35,956 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,961 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 21:52:35,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:52:35,969 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 12 treesize of output 14 [2019-12-07 21:52:35,969 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,985 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 21:52:35,985 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:35,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:35,993 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 21:52:35,993 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-12-07 21:52:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:35,999 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:36,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:52:36,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 7 [2019-12-07 21:52:36,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055603309] [2019-12-07 21:52:36,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:52:36,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:36,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:52:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:52:36,091 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 8 states. [2019-12-07 21:52:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:38,490 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-12-07 21:52:38,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:52:38,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 21:52:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:38,492 INFO L225 Difference]: With dead ends: 89 [2019-12-07 21:52:38,492 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 21:52:38,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:52:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 21:52:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-12-07 21:52:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 21:52:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2019-12-07 21:52:38,495 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 16 [2019-12-07 21:52:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:38,495 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2019-12-07 21:52:38,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:52:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2019-12-07 21:52:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:52:38,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:38,496 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:39,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:39,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1383602186, now seen corresponding path program 1 times [2019-12-07 21:52:39,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:39,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646187321] [2019-12-07 21:52:39,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:39,221 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:52:39,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:39,231 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:39,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646187321] [2019-12-07 21:52:39,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2091789618] [2019-12-07 21:52:39,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:52:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:39,296 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:52:39,297 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:39,299 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:39,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961897639] [2019-12-07 21:52:39,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:39,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:52:39,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:39,346 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:52:39,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:52:39,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 4 [2019-12-07 21:52:39,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093502409] [2019-12-07 21:52:39,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:52:39,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:39,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:52:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:52:39,349 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 4 states. [2019-12-07 21:52:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:39,416 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-12-07 21:52:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:52:39,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 21:52:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:39,417 INFO L225 Difference]: With dead ends: 61 [2019-12-07 21:52:39,417 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 21:52:39,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 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 21:52:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 21:52:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-12-07 21:52:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-07 21:52:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-12-07 21:52:39,421 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 22 [2019-12-07 21:52:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:39,421 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2019-12-07 21:52:39,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:52:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2019-12-07 21:52:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:52:39,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:39,422 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:40,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 21:52:40,025 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1095456886, now seen corresponding path program 1 times [2019-12-07 21:52:40,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:40,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397632501] [2019-12-07 21:52:40,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:40,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:52:40,114 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:40,116 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 21:52:40,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:40,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:40,118 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:40,118 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:52:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:40,139 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:40,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397632501] [2019-12-07 21:52:40,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:40,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-12-07 21:52:40,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987773507] [2019-12-07 21:52:40,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:52:40,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:52:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:52:40,152 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 7 states. [2019-12-07 21:52:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:40,497 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-12-07 21:52:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:52:40,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-07 21:52:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:40,498 INFO L225 Difference]: With dead ends: 112 [2019-12-07 21:52:40,498 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 21:52:40,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 2 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 21:52:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 21:52:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 64. [2019-12-07 21:52:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 21:52:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2019-12-07 21:52:40,501 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 23 [2019-12-07 21:52:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:40,502 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2019-12-07 21:52:40,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:52:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2019-12-07 21:52:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:52:40,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:40,502 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:40,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 21:52:40,704 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:40,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1095456887, now seen corresponding path program 1 times [2019-12-07 21:52:40,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:40,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270546113] [2019-12-07 21:52:40,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 21:52:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:40,782 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 21:52:40,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:40,787 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 21:52:40,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:40,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:40,792 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:40,793 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 21:52:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:40,837 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:41,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270546113] [2019-12-07 21:52:41,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:41,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 21:52:41,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115482525] [2019-12-07 21:52:41,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:52:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:52:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:52:41,089 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 12 states. [2019-12-07 21:52:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:41,876 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2019-12-07 21:52:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:52:41,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-07 21:52:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:41,878 INFO L225 Difference]: With dead ends: 130 [2019-12-07 21:52:41,878 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 21:52:41,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:52:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 21:52:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 64. [2019-12-07 21:52:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 21:52:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-12-07 21:52:41,882 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 23 [2019-12-07 21:52:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:41,882 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-12-07 21:52:41,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:52:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-12-07 21:52:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:52:41,883 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:41,883 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:42,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 21:52:42,085 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash 465817244, now seen corresponding path program 1 times [2019-12-07 21:52:42,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:42,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812662362] [2019-12-07 21:52:42,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 21:52:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:42,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 21:52:42,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:52:42,243 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:52:42,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812662362] [2019-12-07 21:52:42,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:42,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 21:52:42,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469951340] [2019-12-07 21:52:42,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:52:42,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:52:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:52:42,254 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 6 states. [2019-12-07 21:52:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:42,292 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-12-07 21:52:42,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:52:42,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 21:52:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:42,294 INFO L225 Difference]: With dead ends: 94 [2019-12-07 21:52:42,294 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 21:52:42,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 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 21:52:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 21:52:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2019-12-07 21:52:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 21:52:42,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2019-12-07 21:52:42,296 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 25 [2019-12-07 21:52:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:42,297 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2019-12-07 21:52:42,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:52:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2019-12-07 21:52:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:52:42,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:42,297 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:42,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 21:52:42,498 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1596247903, now seen corresponding path program 1 times [2019-12-07 21:52:42,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:42,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738177095] [2019-12-07 21:52:42,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:52:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:42,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:52:42,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:42,682 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 21:52:42,683 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:42,694 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 21:52:42,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738177095] [2019-12-07 21:52:42,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:52:42,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 21:52:42,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899007468] [2019-12-07 21:52:42,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:52:42,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:42,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:52:42,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:52:42,696 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 6 states. [2019-12-07 21:52:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:52:42,740 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-12-07 21:52:42,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:52:42,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 21:52:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:52:42,741 INFO L225 Difference]: With dead ends: 85 [2019-12-07 21:52:42,741 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 21:52:42,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 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 21:52:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 21:52:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2019-12-07 21:52:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 21:52:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2019-12-07 21:52:42,744 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 26 [2019-12-07 21:52:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:52:42,744 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2019-12-07 21:52:42,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:52:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2019-12-07 21:52:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:52:42,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:52:42,745 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:52:42,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 21:52:42,947 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:52:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:52:42,948 INFO L82 PathProgramCache]: Analyzing trace with hash 365128587, now seen corresponding path program 1 times [2019-12-07 21:52:42,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:52:42,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452906826] [2019-12-07 21:52:42,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 21:52:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:43,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 21:52:43,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:43,108 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 21:52:43,108 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:43,110 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,110 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:52:43,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:43,124 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 21:52:43,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:43,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,129 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 21:52:43,140 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 13 treesize of output 9 [2019-12-07 21:52:43,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:43,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,148 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 21:52:43,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:52:43,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:52:43,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:43,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 21:52:43,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:52:43,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:43,261 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 3 case distinctions, treesize of input 56 treesize of output 111 [2019-12-07 21:52:43,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:52:43,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:43,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:52:43,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:43,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 21:52:43,332 INFO L614 ElimStorePlain]: treesize reduction 313, result has 13.5 percent of original size [2019-12-07 21:52:43,333 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 21:52:43,333 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2019-12-07 21:52:43,613 INFO L343 Elim1Store]: treesize reduction 24, result has 66.7 percent of original size [2019-12-07 21:52:43,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 82 [2019-12-07 21:52:43,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,645 INFO L614 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-12-07 21:52:43,645 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 21:52:43,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:43 [2019-12-07 21:52:43,725 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:43,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 21:52:43,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:43,737 INFO L614 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-12-07 21:52:43,738 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 21:52:43,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:5 [2019-12-07 21:52:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:43,790 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:43,911 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 21:52:43,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:43,915 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 21:52:43,915 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2019-12-07 21:52:44,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:44,164 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 30 treesize of output 34 [2019-12-07 21:52:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:44,165 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:44,169 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 21:52:44,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-12-07 21:52:44,318 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:44,319 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 21:52:44,319 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:1 [2019-12-07 21:52:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:52:44,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452906826] [2019-12-07 21:52:44,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2025130211] [2019-12-07 21:52:44,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:52:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:44,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 21:52:44,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:44,479 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 21:52:44,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:44,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,481 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:52:44,496 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:44,497 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 21:52:44,497 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,513 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-07 21:52:44,513 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 21:52:44,556 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 13 treesize of output 9 [2019-12-07 21:52:44,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:44,566 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,566 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 21:52:44,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:52:44,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:52:44,624 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:44,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-12-07 21:52:44,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:52:44,766 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:44,766 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 56 treesize of output 111 [2019-12-07 21:52:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:52:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:52:44,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:44,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:44,846 INFO L614 ElimStorePlain]: treesize reduction 386, result has 12.7 percent of original size [2019-12-07 21:52:44,846 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 21:52:44,846 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-12-07 21:52:45,329 INFO L343 Elim1Store]: treesize reduction 24, result has 66.7 percent of original size [2019-12-07 21:52:45,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 82 [2019-12-07 21:52:45,330 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:45,369 INFO L614 ElimStorePlain]: treesize reduction 32, result has 61.0 percent of original size [2019-12-07 21:52:45,369 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 21:52:45,370 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:50 [2019-12-07 21:52:45,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:45,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 21:52:45,484 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:45,496 INFO L614 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-12-07 21:52:45,497 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 21:52:45,497 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:17 [2019-12-07 21:52:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:45,630 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:45,680 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 21:52:45,683 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:45,684 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 21:52:45,684 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2019-12-07 21:52:49,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,361 INFO L614 ElimStorePlain]: treesize reduction 33, result has 17.5 percent of original size [2019-12-07 21:52:49,361 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 21:52:49,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:7 [2019-12-07 21:52:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:49,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982238341] [2019-12-07 21:52:49,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:52:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:52:49,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 21:52:49,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:52:49,561 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 21:52:49,561 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:49,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:52:49,569 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:49,569 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 21:52:49,569 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:49,573 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 21:52:49,576 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 13 treesize of output 9 [2019-12-07 21:52:49,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,583 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:49,584 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,584 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 21:52:49,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:52:49,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:52:49,588 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:49,597 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 21:52:49,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:52:49,657 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:49,657 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 3 case distinctions, treesize of input 58 treesize of output 113 [2019-12-07 21:52:49,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:52:49,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:52:49,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:49,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:49,659 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 21:52:49,732 INFO L614 ElimStorePlain]: treesize reduction 442, result has 10.0 percent of original size [2019-12-07 21:52:49,732 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 21:52:49,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-12-07 21:52:49,830 INFO L343 Elim1Store]: treesize reduction 24, result has 66.7 percent of original size [2019-12-07 21:52:49,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 82 [2019-12-07 21:52:49,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,863 INFO L614 ElimStorePlain]: treesize reduction 36, result has 53.2 percent of original size [2019-12-07 21:52:49,863 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 21:52:49,864 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:41 [2019-12-07 21:52:49,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:49,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2019-12-07 21:52:49,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:49,926 INFO L614 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-12-07 21:52:49,926 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 21:52:49,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:5 [2019-12-07 21:52:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:52:49,933 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:52:49,981 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 21:52:49,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:49,985 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 21:52:49,985 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2019-12-07 21:52:53,233 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:53,234 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 30 treesize of output 34 [2019-12-07 21:52:53,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:52:53,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:53,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:53,238 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 21:52:53,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2019-12-07 21:52:53,345 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:52:53,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:52:53,346 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 21:52:53,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:1 [2019-12-07 21:52:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:52:53,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:52:53,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14, 13, 14, 10] total 35 [2019-12-07 21:52:53,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678362868] [2019-12-07 21:52:53,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 21:52:53,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:52:53,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 21:52:53,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 21:52:53,350 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 36 states. [2019-12-07 21:52:54,806 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-07 21:52:57,100 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 21:52:58,171 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-12-07 21:52:58,469 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 21:53:01,494 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 21:53:03,865 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 21:53:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:04,120 INFO L93 Difference]: Finished difference Result 220 states and 256 transitions. [2019-12-07 21:53:04,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 21:53:04,120 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 30 [2019-12-07 21:53:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:04,122 INFO L225 Difference]: With dead ends: 220 [2019-12-07 21:53:04,122 INFO L226 Difference]: Without dead ends: 220 [2019-12-07 21:53:04,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 122 SyntacticMatches, 21 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=584, Invalid=2956, Unknown=0, NotChecked=0, Total=3540 [2019-12-07 21:53:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-07 21:53:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 88. [2019-12-07 21:53:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 21:53:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2019-12-07 21:53:04,128 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 30 [2019-12-07 21:53:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:04,128 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2019-12-07 21:53:04,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 21:53:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2019-12-07 21:53:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:53:04,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:04,129 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:04,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3,21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:53:04,731 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:53:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:04,731 INFO L82 PathProgramCache]: Analyzing trace with hash 365128588, now seen corresponding path program 1 times [2019-12-07 21:53:04,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:53:04,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845697989] [2019-12-07 21:53:04,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 21:53:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:04,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 21:53:04,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:04,910 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 21:53:04,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:04,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:04,919 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 21:53:04,919 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:04,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:04,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:04,924 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 21:53:04,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:04,946 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 12 treesize of output 14 [2019-12-07 21:53:04,946 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:04,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:04,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:04,966 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 21:53:04,966 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:04,976 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:04,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:04,976 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 21:53:04,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 21:53:04,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,013 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,016 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 13 treesize of output 9 [2019-12-07 21:53:05,016 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,030 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,030 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 21:53:05,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:05,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:53:05,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:05,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:53:05,091 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,111 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-12-07 21:53:05,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:05,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:05,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:53:05,165 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,165 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 1 case distinctions, treesize of input 79 treesize of output 72 [2019-12-07 21:53:05,165 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,219 INFO L614 ElimStorePlain]: treesize reduction 30, result has 76.0 percent of original size [2019-12-07 21:53:05,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:05,224 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 42 treesize of output 38 [2019-12-07 21:53:05,224 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,245 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,245 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:85 [2019-12-07 21:53:05,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 55 [2019-12-07 21:53:05,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,576 INFO L614 ElimStorePlain]: treesize reduction 20, result has 80.8 percent of original size [2019-12-07 21:53:05,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-12-07 21:53:05,580 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,599 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,599 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:69 [2019-12-07 21:53:05,695 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-12-07 21:53:05,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,723 INFO L614 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-12-07 21:53:05,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 21:53:05,726 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:05,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:05,735 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 21:53:05,735 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:22 [2019-12-07 21:53:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:53:05,834 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:06,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:06,222 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 21:53:06,231 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:06,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:06,275 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 21:53:06,278 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 21:53:06,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:06,316 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 21:53:06,316 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2019-12-07 21:53:07,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:08,063 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 21:53:08,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:08,076 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:08,425 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 21:53:08,426 INFO L614 ElimStorePlain]: treesize reduction 66, result has 64.1 percent of original size [2019-12-07 21:53:08,433 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:08,536 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-12-07 21:53:08,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:08,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 21:53:08,536 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:77 [2019-12-07 21:53:08,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:08,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:08,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:08,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:08,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:09,115 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-07 21:53:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:53:09,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845697989] [2019-12-07 21:53:09,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2128718355] [2019-12-07 21:53:09,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:53:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:09,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 21:53:09,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:09,606 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 21:53:09,606 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,613 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 21:53:09,613 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,618 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,618 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 21:53:09,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,627 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 21:53:09,628 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,642 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 12 treesize of output 14 [2019-12-07 21:53:09,642 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,652 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,652 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 21:53:09,657 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 13 treesize of output 9 [2019-12-07 21:53:09,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,677 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 13 treesize of output 9 [2019-12-07 21:53:09,678 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,693 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 21:53:09,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:09,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:53:09,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:09,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:53:09,732 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,752 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-12-07 21:53:09,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:09,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:09,759 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:53:09,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,774 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 1 case distinctions, treesize of input 79 treesize of output 72 [2019-12-07 21:53:09,774 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,827 INFO L614 ElimStorePlain]: treesize reduction 30, result has 76.0 percent of original size [2019-12-07 21:53:09,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:09,832 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 42 treesize of output 38 [2019-12-07 21:53:09,832 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,852 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,852 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,853 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:85 [2019-12-07 21:53:09,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 55 [2019-12-07 21:53:09,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,945 INFO L614 ElimStorePlain]: treesize reduction 12, result has 87.8 percent of original size [2019-12-07 21:53:09,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-12-07 21:53:09,950 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,972 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:09,972 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:09,972 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2019-12-07 21:53:10,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:10,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-12-07 21:53:10,021 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:10,049 INFO L614 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-12-07 21:53:10,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 21:53:10,052 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:10,060 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:10,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 21:53:10,060 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:22 [2019-12-07 21:53:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:53:10,109 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:10,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:10,123 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:10,126 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 21:53:10,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:10,179 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 21:53:10,183 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 21:53:10,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:10,217 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 21:53:10,217 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2019-12-07 21:53:11,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:11,219 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 21:53:11,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:11,243 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:11,540 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-12-07 21:53:11,541 INFO L614 ElimStorePlain]: treesize reduction 66, result has 64.1 percent of original size [2019-12-07 21:53:11,550 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:11,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:11,635 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 21:53:11,635 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:77 [2019-12-07 21:53:11,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:11,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:11,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:11,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:11,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:53:12,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555031023] [2019-12-07 21:53:12,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:53:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:12,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 21:53:12,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:12,173 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 21:53:12,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,181 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 21:53:12,181 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,186 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,186 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 21:53:12,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:12,193 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 12 treesize of output 14 [2019-12-07 21:53:12,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,210 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 21:53:12,211 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,219 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-12-07 21:53:12,224 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 13 treesize of output 9 [2019-12-07 21:53:12,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,243 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 13 treesize of output 9 [2019-12-07 21:53:12,243 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,257 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,257 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,257 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 21:53:12,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:12,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:53:12,264 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:12,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:53:12,295 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,316 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-12-07 21:53:12,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:12,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:12,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:53:12,337 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,338 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 1 case distinctions, treesize of input 79 treesize of output 72 [2019-12-07 21:53:12,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,397 INFO L614 ElimStorePlain]: treesize reduction 30, result has 76.0 percent of original size [2019-12-07 21:53:12,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:12,402 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 42 treesize of output 38 [2019-12-07 21:53:12,403 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,425 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,425 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:85 [2019-12-07 21:53:12,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 55 [2019-12-07 21:53:12,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,521 INFO L614 ElimStorePlain]: treesize reduction 16, result has 84.0 percent of original size [2019-12-07 21:53:12,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2019-12-07 21:53:12,526 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,543 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:69 [2019-12-07 21:53:12,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 37 [2019-12-07 21:53:12,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,618 INFO L614 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-12-07 21:53:12,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 21:53:12,621 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,628 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,628 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 21:53:12,628 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:22 [2019-12-07 21:53:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:53:12,672 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:12,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:12,681 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 21:53:12,685 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 21:53:12,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,760 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:12,763 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 21:53:12,793 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:12,793 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 21:53:12,793 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:69 [2019-12-07 21:53:13,672 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:18,571 WARN L192 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2019-12-07 21:53:18,572 INFO L614 ElimStorePlain]: treesize reduction 69, result has 63.7 percent of original size [2019-12-07 21:53:18,583 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:18,706 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 21:53:18,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:18,713 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:18,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:18,813 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 21:53:18,813 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:157, output treesize:77 [2019-12-07 21:53:19,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:19,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:19,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:19,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:19,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:19,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:19,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:53:19,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:53:19,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14, 13, 14, 13] total 26 [2019-12-07 21:53:19,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779911016] [2019-12-07 21:53:19,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 21:53:19,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:53:19,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 21:53:19,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-12-07 21:53:19,474 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand 27 states. [2019-12-07 21:53:21,109 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-07 21:53:21,618 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 21:53:22,130 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-12-07 21:53:22,652 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 125 [2019-12-07 21:53:23,154 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-07 21:53:23,559 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-12-07 21:53:24,070 WARN L192 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2019-12-07 21:53:24,735 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 127 [2019-12-07 21:53:27,956 WARN L192 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 150 DAG size of output: 133 [2019-12-07 21:53:28,879 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-12-07 21:53:29,682 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 118 [2019-12-07 21:53:30,570 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 21:53:30,974 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 21:53:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:31,058 INFO L93 Difference]: Finished difference Result 255 states and 291 transitions. [2019-12-07 21:53:31,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 21:53:31,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-12-07 21:53:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:31,061 INFO L225 Difference]: With dead ends: 255 [2019-12-07 21:53:31,061 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 21:53:31,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 131 SyntacticMatches, 18 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 21:53:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 21:53:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 95. [2019-12-07 21:53:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 21:53:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2019-12-07 21:53:31,065 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 30 [2019-12-07 21:53:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:31,065 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2019-12-07 21:53:31,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 21:53:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2019-12-07 21:53:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:53:31,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:31,066 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:31,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:53:31,668 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:53:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:31,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1370153284, now seen corresponding path program 1 times [2019-12-07 21:53:31,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:53:31,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105234857] [2019-12-07 21:53:31,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 21:53:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:31,759 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:53:31,759 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:31,770 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:31,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105234857] [2019-12-07 21:53:31,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [648117270] [2019-12-07 21:53:31,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:53:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:31,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:53:31,939 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:31,941 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:31,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060130240] [2019-12-07 21:53:31,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:53:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:31,998 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 21:53:31,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:32,047 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:32,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 21:53:32,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5, 5, 5, 5] total 13 [2019-12-07 21:53:32,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108497680] [2019-12-07 21:53:32,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:53:32,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:53:32,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:53:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:53:32,058 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand 7 states. [2019-12-07 21:53:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:32,415 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-12-07 21:53:32,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:53:32,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 21:53:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:32,416 INFO L225 Difference]: With dead ends: 117 [2019-12-07 21:53:32,417 INFO L226 Difference]: Without dead ends: 117 [2019-12-07 21:53:32,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:53:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-12-07 21:53:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2019-12-07 21:53:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 21:53:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2019-12-07 21:53:32,419 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 33 [2019-12-07 21:53:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:32,419 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2019-12-07 21:53:32,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:53:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2019-12-07 21:53:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:53:32,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:32,419 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:33,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2019-12-07 21:53:33,022 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:53:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1370153285, now seen corresponding path program 1 times [2019-12-07 21:53:33,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:53:33,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487009928] [2019-12-07 21:53:33,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 21:53:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:33,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:53:33,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:33,168 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:33,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487009928] [2019-12-07 21:53:33,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1644624637] [2019-12-07 21:53:33,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:53:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:33,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:53:33,328 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:33,334 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:33,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069935010] [2019-12-07 21:53:33,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:53:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:33,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 21:53:33,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:33,393 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 21:53:33,393 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:33,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:33,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:33,397 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 21:53:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 21:53:33,467 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 21:53:33,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 21:53:33,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5, 5, 5, 5] total 18 [2019-12-07 21:53:33,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583289778] [2019-12-07 21:53:33,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:53:33,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:53:33,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:53:33,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-07 21:53:33,803 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 12 states. [2019-12-07 21:53:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:34,526 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2019-12-07 21:53:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:53:34,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-12-07 21:53:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:34,528 INFO L225 Difference]: With dead ends: 130 [2019-12-07 21:53:34,528 INFO L226 Difference]: Without dead ends: 130 [2019-12-07 21:53:34,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-12-07 21:53:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-07 21:53:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2019-12-07 21:53:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 21:53:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2019-12-07 21:53:34,530 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 33 [2019-12-07 21:53:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:34,531 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2019-12-07 21:53:34,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:53:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2019-12-07 21:53:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:53:34,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:34,531 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:35,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 mathsat -unsat_core_generation=3,29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:53:35,133 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:53:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1604753366, now seen corresponding path program 2 times [2019-12-07 21:53:35,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:53:35,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016112412] [2019-12-07 21:53:35,135 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 21:53:35,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:53:35,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:53:35,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:53:35,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:35,333 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:35,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016112412] [2019-12-07 21:53:35,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [635037288] [2019-12-07 21:53:35,386 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:53:35,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:53:35,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:53:35,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:53:35,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:35,537 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:35,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951335654] [2019-12-07 21:53:35,539 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:53:35,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:53:35,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:53:35,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:53:35,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:35,608 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 21:53:35,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:53:35,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2019-12-07 21:53:35,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189710288] [2019-12-07 21:53:35,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 21:53:35,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:53:35,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 21:53:35,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 21:53:35,824 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 16 states. [2019-12-07 21:53:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:36,840 INFO L93 Difference]: Finished difference Result 372 states and 420 transitions. [2019-12-07 21:53:36,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 21:53:36,840 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2019-12-07 21:53:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:36,842 INFO L225 Difference]: With dead ends: 372 [2019-12-07 21:53:36,842 INFO L226 Difference]: Without dead ends: 372 [2019-12-07 21:53:36,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 21:53:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-07 21:53:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 127. [2019-12-07 21:53:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 21:53:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2019-12-07 21:53:36,847 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 33 [2019-12-07 21:53:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:36,848 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2019-12-07 21:53:36,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 21:53:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2019-12-07 21:53:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:53:36,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:36,848 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:53:37,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 mathsat -unsat_core_generation=3,32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:53:37,451 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:53:37,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash 102278925, now seen corresponding path program 1 times [2019-12-07 21:53:37,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:53:37,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477101230] [2019-12-07 21:53:37,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:53:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:37,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:53:37,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 21:53:37,670 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 21:53:37,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477101230] [2019-12-07 21:53:37,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [955782451] [2019-12-07 21:53:37,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:53:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:37,886 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:53:37,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 21:53:37,896 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 21:53:37,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340526955] [2019-12-07 21:53:37,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/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 21:53:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:37,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 21:53:37,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 21:53:37,984 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 21:53:38,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:53:38,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 7, 9] total 17 [2019-12-07 21:53:38,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480696762] [2019-12-07 21:53:38,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 21:53:38,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:53:38,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 21:53:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:53:38,246 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand 17 states. [2019-12-07 21:53:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:38,336 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-12-07 21:53:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:53:38,337 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2019-12-07 21:53:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:38,337 INFO L225 Difference]: With dead ends: 85 [2019-12-07 21:53:38,337 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 21:53:38,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 197 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-12-07 21:53:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 21:53:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2019-12-07 21:53:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 21:53:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-12-07 21:53:38,340 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 37 [2019-12-07 21:53:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:38,340 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-12-07 21:53:38,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 21:53:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-12-07 21:53:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 21:53:38,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:38,341 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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 21:53:38,942 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 21:53:38,943 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:53:38,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1061275374, now seen corresponding path program 1 times [2019-12-07 21:53:38,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:53:38,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659397948] [2019-12-07 21:53:38,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 21:53:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:39,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:53:39,147 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 21:53:39,154 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 21:53:39,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659397948] [2019-12-07 21:53:39,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:53:39,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 21:53:39,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178764999] [2019-12-07 21:53:39,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:53:39,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:53:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:53:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:53:39,165 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 6 states. [2019-12-07 21:53:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:53:39,194 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-12-07 21:53:39,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:53:39,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 21:53:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:53:39,194 INFO L225 Difference]: With dead ends: 76 [2019-12-07 21:53:39,194 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 21:53:39,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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 21:53:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 21:53:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-12-07 21:53:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 21:53:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-12-07 21:53:39,196 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 39 [2019-12-07 21:53:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:53:39,196 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-12-07 21:53:39,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:53:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-12-07 21:53:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:53:39,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:53:39,197 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 21:53:39,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 21:53:39,397 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-12-07 21:53:39,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:53:39,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1409631431, now seen corresponding path program 1 times [2019-12-07 21:53:39,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:53:39,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383914994] [2019-12-07 21:53:39,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 21:53:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:53:39,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 21:53:39,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:53:39,575 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 21:53:39,575 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:39,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 21:53:39,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:39,590 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 21:53:39,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:39,594 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2019-12-07 21:53:39,606 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 13 treesize of output 9 [2019-12-07 21:53:39,606 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:39,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,615 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 21:53:39,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:39,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 21:53:39,640 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:39,652 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,652 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-12-07 21:53:39,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:39,735 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:39,735 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 3 case distinctions, treesize of input 45 treesize of output 106 [2019-12-07 21:53:39,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:39,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:39,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:39,761 INFO L614 ElimStorePlain]: treesize reduction 28, result has 57.6 percent of original size [2019-12-07 21:53:39,761 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 21:53:39,762 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-12-07 21:53:39,976 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_170|], 10=[|v_#memory_$Pointer$.base_199|]} [2019-12-07 21:53:39,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 21:53:39,982 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:40,014 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:48,204 WARN L192 SmtUtils]: Spent 8.19 s on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 21:53:48,204 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:48,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 99 [2019-12-07 21:53:48,205 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:48,242 INFO L614 ElimStorePlain]: treesize reduction 64, result has 37.9 percent of original size [2019-12-07 21:53:48,242 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 21:53:48,242 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:39 [2019-12-07 21:53:48,364 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:53:48,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:53:48,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:48,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 47 [2019-12-07 21:53:48,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:48,400 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 21:53:48,400 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 21:53:48,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:15 [2019-12-07 21:53:48,481 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 19 treesize of output 18 [2019-12-07 21:53:48,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:48,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:48,490 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 21:53:48,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2019-12-07 21:53:48,620 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 21:53:48,620 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:53:48,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:53:48,621 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 21:53:48,621 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 21:53:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:53:48,733 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:53:49,564 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 194 treesize of output 186 [2019-12-07 21:53:49,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:53:49,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:49,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:49,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:53:49,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 21:53:51,862 WARN L192 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-12-07 21:53:51,862 INFO L614 ElimStorePlain]: treesize reduction 302, result has 26.9 percent of original size [2019-12-07 21:53:51,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 21:53:51,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 21:53:51,865 INFO L534 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-12-07 21:54:16,436 WARN L192 SmtUtils]: Spent 24.57 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-12-07 21:54:16,437 INFO L614 ElimStorePlain]: treesize reduction 23, result has 81.7 percent of original size [2019-12-07 21:54:16,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 21:54:16,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2019-12-07 21:54:16,438 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:91 [2019-12-07 21:54:20,670 WARN L192 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-12-07 21:54:27,780 WARN L192 SmtUtils]: Spent 6.37 s on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-12-07 21:54:27,780 INFO L343 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2019-12-07 21:54:27,780 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 43 treesize of output 34 [2019-12-07 21:54:27,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:54:27,787 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 34 treesize of output 36 [2019-12-07 21:54:27,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:54:27,788 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_128], 2=[v_arrayElimCell_129]} [2019-12-07 21:54:27,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383914994] [2019-12-07 21:54:27,791 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@478090c0 [2019-12-07 21:54:27,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1878700454] [2019-12-07 21:54:27,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:54:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:28,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 21:54:28,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:54:28,087 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@478090c0 [2019-12-07 21:54:28,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712082146] [2019-12-07 21:54:28,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3cc86d79-02d2-48a0-8154-cf706dfd04e2/bin/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:54:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:54:28,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 21:54:28,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:54:28,146 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@478090c0 [2019-12-07 21:54:28,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:54:28,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 21:54:28,147 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 21:54:28,147 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:54:28,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 cvc4 --incremental --print-success --lang smt --rewrite-divk,38 mathsat -unsat_core_generation=3,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:54:28,768 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 21:54:28,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:54:28 BoogieIcfgContainer [2019-12-07 21:54:28,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:54:28,769 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:54:28,769 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:54:28,769 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:54:28,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:52:32" (3/4) ... [2019-12-07 21:54:28,772 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 21:54:28,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:54:28,773 INFO L168 Benchmark]: Toolchain (without parser) took 117238.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 948.4 MB in the beginning and 891.4 MB in the end (delta: 56.9 MB). Peak memory consumption was 363.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:54:28,773 INFO L168 Benchmark]: CDTParser took 0.12 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 21:54:28,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:54:28,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.92 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 21:54:28,774 INFO L168 Benchmark]: Boogie Preprocessor took 26.23 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 21:54:28,774 INFO L168 Benchmark]: RCFGBuilder took 352.01 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: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:54:28,774 INFO L168 Benchmark]: TraceAbstraction took 116489.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 891.4 MB in the end (delta: 184.4 MB). Peak memory consumption was 351.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:54:28,774 INFO L168 Benchmark]: Witness Printer took 3.24 ms. Allocated memory is still 1.3 GB. Free memory is still 891.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:54:28,776 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.12 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 329.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.23 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 352.01 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: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 116489.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 891.4 MB in the end (delta: 184.4 MB). Peak memory consumption was 351.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.24 ms. Allocated memory is still 1.3 GB. Free memory is still 891.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 630]: 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: [L614] const int len = 2; [L615] const int data = 1; [L575] DLL head = ((void *)0); [L576] COND TRUE len > 0 [L577] DLL new_head = (DLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) [L581] new_head->data = data [L582] new_head->next = head [L583] new_head->prev = ((void *)0) [L584] COND FALSE !(\read(head)) [L587] head = new_head [L588] len-- [L576] COND TRUE len > 0 [L577] DLL new_head = (DLL) malloc(sizeof(struct node)); [L578] COND FALSE !(((void *)0) == new_head) [L581] new_head->data = data [L582] new_head->next = head [L583] new_head->prev = ((void *)0) [L584] COND TRUE \read(head) [L585] head->prev = new_head [L587] head = new_head [L588] len-- [L576] COND FALSE !(len > 0) [L590] return head; [L616] DLL s = dll_create(len, data); [L617] int i; [L618] i = 0 [L618] COND TRUE i < len [L619] int new_data = i + len; [L607] COND FALSE !(index > 0) [L611] head->data = data [L618] i++ [L618] COND TRUE i < len [L619] int new_data = i + len; [L607] COND TRUE index > 0 [L608] EXPR head->next [L608] head = head->next [L609] index-- [L607] COND FALSE !(index > 0) [L611] head->data = data [L618] i++ [L618] COND FALSE !(i < len) [L622] i = 0 [L622] COND TRUE i < len [L623] int expected = i + len; [L600] COND FALSE !(index > 0) [L604] EXPR head->data [L604] return head->data; [L624] COND TRUE expected != dll_get_data_at(s, i) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 23 error locations. Result: UNKNOWN, OverallTime: 116.4s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 28.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 979 SDtfs, 6046 SDslu, 2609 SDs, 0 SdLazy, 2471 SolverSat, 359 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1855 GetRequests, 1541 SyntacticMatches, 60 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2263 ImplicationChecksByTransitivity, 33.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred 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, 853 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1754 ConstructedInterpolants, 142 QuantifiedInterpolants, 472277 SizeOfPredicates, 296 NumberOfNonLiveVariables, 4302 ConjunctsInSsa, 402 ConjunctsInUnsatCore, 72 InterpolantComputations, 22 PerfectInterpolantSequences, 587/866 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...