./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.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_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 bea41ba7ef8afa8e6ccd1150cee95a00bf0377da ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 bea41ba7ef8afa8e6ccd1150cee95a00bf0377da ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58c53ede --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:04:49,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:04:49,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:04:49,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:04:49,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:04:49,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:04:49,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:04:49,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:04:49,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:04:49,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:04:49,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:04:49,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:04:49,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:04:49,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:04:49,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:04:49,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:04:49,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:04:49,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:04:49,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:04:49,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:04:49,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:04:49,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:04:49,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:04:49,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:04:49,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:04:49,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:04:49,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:04:49,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:04:49,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:04:49,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:04:49,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:04:49,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:04:49,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:04:49,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:04:49,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:04:49,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:04:49,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:04:49,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:04:49,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:04:49,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:04:49,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:04:49,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 20:04:49,277 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:04:49,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:04:49,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:04:49,278 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:04:49,278 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:04:49,279 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:04:49,279 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:04:49,279 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:04:49,279 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:04:49,279 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:04:49,279 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:04:49,280 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:04:49,280 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:04:49,280 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:04:49,280 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:04:49,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:04:49,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:04:49,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:04:49,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:04:49,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:04:49,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:04:49,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:04:49,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:04:49,282 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:04:49,282 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:04:49,283 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:04:49,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:04:49,283 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:04:49,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:04:49,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:04:49,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:04:49,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:04:49,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:04:49,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:04:49,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:04:49,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:04:49,285 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:04:49,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:04:49,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:04:49,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:04:49,285 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_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 -> bea41ba7ef8afa8e6ccd1150cee95a00bf0377da [2019-12-07 20:04:49,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:04:49,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:04:49,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:04:49,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:04:49,407 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:04:49,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i [2019-12-07 20:04:49,444 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data/bf8cf1111/217df0dd3d9844cdaed20b8ac738e36c/FLAG2e330a3c3 [2019-12-07 20:04:49,802 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:04:49,803 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i [2019-12-07 20:04:49,813 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data/bf8cf1111/217df0dd3d9844cdaed20b8ac738e36c/FLAG2e330a3c3 [2019-12-07 20:04:49,821 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data/bf8cf1111/217df0dd3d9844cdaed20b8ac738e36c [2019-12-07 20:04:49,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:04:49,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:04:49,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:04:49,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:04:49,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:04:49,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:04:49" (1/1) ... [2019-12-07 20:04:49,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f87f835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:49, skipping insertion in model container [2019-12-07 20:04:49,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:04:49" (1/1) ... [2019-12-07 20:04:49,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:04:49,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:04:50,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:04:50,086 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:04:50,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:04:50,151 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:04:50,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50 WrapperNode [2019-12-07 20:04:50,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:04:50,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:04:50,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:04:50,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:04:50,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:04:50,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:04:50,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:04:50,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:04:50,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... [2019-12-07 20:04:50,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:04:50,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:04:50,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:04:50,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:04:50,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:04:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 20:04:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:04:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:04:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:04:50,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:04:50,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:04:50,546 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:04:50,546 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 20:04:50,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:04:50 BoogieIcfgContainer [2019-12-07 20:04:50,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:04:50,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:04:50,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:04:50,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:04:50,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:04:49" (1/3) ... [2019-12-07 20:04:50,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c574619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:04:50, skipping insertion in model container [2019-12-07 20:04:50,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:04:50" (2/3) ... [2019-12-07 20:04:50,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c574619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:04:50, skipping insertion in model container [2019-12-07 20:04:50,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:04:50" (3/3) ... [2019-12-07 20:04:50,553 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca-2.i [2019-12-07 20:04:50,560 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:04:50,565 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-12-07 20:04:50,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-12-07 20:04:50,585 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:04:50,585 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:04:50,585 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:04:50,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:04:50,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:04:50,586 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:04:50,586 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:04:50,586 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:04:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-12-07 20:04:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:04:50,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:50,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:04:50,601 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:50,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:50,605 INFO L82 PathProgramCache]: Analyzing trace with hash 162281, now seen corresponding path program 1 times [2019-12-07 20:04:50,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:50,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693511205] [2019-12-07 20:04:50,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:50,706 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 20:04:50,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693511205] [2019-12-07 20:04:50,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:50,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:04:50,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500083072] [2019-12-07 20:04:50,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:04:50,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:04:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:04:50,722 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-12-07 20:04:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:50,762 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-12-07 20:04:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:04:50,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:04:50,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:50,770 INFO L225 Difference]: With dead ends: 38 [2019-12-07 20:04:50,770 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 20:04:50,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:04:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 20:04:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 20:04:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 20:04:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-12-07 20:04:50,794 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 3 [2019-12-07 20:04:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:50,794 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-12-07 20:04:50,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:04:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-12-07 20:04:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:04:50,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:50,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:04:50,795 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash 5029971, now seen corresponding path program 1 times [2019-12-07 20:04:50,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:50,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633943572] [2019-12-07 20:04:50,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:50,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633943572] [2019-12-07 20:04:50,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:50,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:04:50,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288516593] [2019-12-07 20:04:50,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:04:50,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:04:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:04:50,842 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2019-12-07 20:04:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:50,865 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-12-07 20:04:50,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:04:50,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 20:04:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:50,866 INFO L225 Difference]: With dead ends: 34 [2019-12-07 20:04:50,866 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 20:04:50,867 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 20:04:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 20:04:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 20:04:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 20:04:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-12-07 20:04:50,870 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 4 [2019-12-07 20:04:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:50,870 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-12-07 20:04:50,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:04:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-12-07 20:04:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:04:50,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:50,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:04:50,871 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:50,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:50,871 INFO L82 PathProgramCache]: Analyzing trace with hash 5029972, now seen corresponding path program 1 times [2019-12-07 20:04:50,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:50,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254913122] [2019-12-07 20:04:50,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:50,924 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 20:04:50,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254913122] [2019-12-07 20:04:50,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:50,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:04:50,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980177711] [2019-12-07 20:04:50,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:04:50,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:50,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:04:50,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:04:50,926 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 4 states. [2019-12-07 20:04:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:51,002 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-12-07 20:04:51,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:04:51,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 20:04:51,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:51,003 INFO L225 Difference]: With dead ends: 65 [2019-12-07 20:04:51,003 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 20:04:51,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 20:04:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 20:04:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 36. [2019-12-07 20:04:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 20:04:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-12-07 20:04:51,007 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 4 [2019-12-07 20:04:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:51,007 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-12-07 20:04:51,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:04:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-12-07 20:04:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:04:51,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:51,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:04:51,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:51,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash 156031516, now seen corresponding path program 1 times [2019-12-07 20:04:51,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:51,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354402950] [2019-12-07 20:04:51,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:51,028 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 20:04:51,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354402950] [2019-12-07 20:04:51,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:51,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:04:51,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043890131] [2019-12-07 20:04:51,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:04:51,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:04:51,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:04:51,029 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 3 states. [2019-12-07 20:04:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:51,049 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-12-07 20:04:51,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:04:51,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 20:04:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:51,050 INFO L225 Difference]: With dead ends: 34 [2019-12-07 20:04:51,050 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 20:04:51,050 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 20:04:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 20:04:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 20:04:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 20:04:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-12-07 20:04:51,053 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 5 [2019-12-07 20:04:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:51,053 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-12-07 20:04:51,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:04:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-12-07 20:04:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:04:51,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:51,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:04:51,054 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:51,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash 156031517, now seen corresponding path program 1 times [2019-12-07 20:04:51,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:51,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735691538] [2019-12-07 20:04:51,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:51,091 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 20:04:51,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735691538] [2019-12-07 20:04:51,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:51,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:04:51,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936201545] [2019-12-07 20:04:51,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:04:51,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:51,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:04:51,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:04:51,093 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 5 states. [2019-12-07 20:04:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:51,152 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-12-07 20:04:51,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:04:51,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-12-07 20:04:51,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:51,153 INFO L225 Difference]: With dead ends: 60 [2019-12-07 20:04:51,153 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 20:04:51,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:04:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 20:04:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-12-07 20:04:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 20:04:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2019-12-07 20:04:51,156 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 5 [2019-12-07 20:04:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:51,157 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2019-12-07 20:04:51,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:04:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2019-12-07 20:04:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:04:51,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:51,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:04:51,157 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash 156034285, now seen corresponding path program 1 times [2019-12-07 20:04:51,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:51,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694951464] [2019-12-07 20:04:51,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:51,238 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 20:04:51,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694951464] [2019-12-07 20:04:51,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:51,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:04:51,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92677376] [2019-12-07 20:04:51,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:04:51,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:51,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:04:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:04:51,240 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2019-12-07 20:04:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:51,292 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-12-07 20:04:51,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:04:51,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-12-07 20:04:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:51,293 INFO L225 Difference]: With dead ends: 65 [2019-12-07 20:04:51,293 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 20:04:51,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:04:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 20:04:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 37. [2019-12-07 20:04:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 20:04:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-12-07 20:04:51,297 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 5 [2019-12-07 20:04:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:51,298 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-12-07 20:04:51,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:04:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-12-07 20:04:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 20:04:51,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:51,298 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 20:04:51,298 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 538925267, now seen corresponding path program 1 times [2019-12-07 20:04:51,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:51,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395174085] [2019-12-07 20:04:51,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:51,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395174085] [2019-12-07 20:04:51,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651232825] [2019-12-07 20:04:51,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:04:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:51,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 20:04:51,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:51,425 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_52|]} [2019-12-07 20:04:51,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:04:51,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:04:51,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:51,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:51,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:04:51,455 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:04:51,463 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:04:51,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:04:51,464 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 20:04:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:51,484 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:51,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:04:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:51,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019328594] [2019-12-07 20:04:51,548 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 20:04:51,548 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:04:51,552 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:04:51,556 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:04:51,556 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:04:51,684 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:04:51,902 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:04:52,247 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:04:52,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:04:52,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-12-07 20:04:52,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449688952] [2019-12-07 20:04:52,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:04:52,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:04:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:04:52,248 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 9 states. [2019-12-07 20:04:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:52,376 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2019-12-07 20:04:52,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:04:52,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-12-07 20:04:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:52,377 INFO L225 Difference]: With dead ends: 94 [2019-12-07 20:04:52,377 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 20:04:52,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:04:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 20:04:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 35. [2019-12-07 20:04:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 20:04:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-12-07 20:04:52,381 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 6 [2019-12-07 20:04:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:52,381 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-12-07 20:04:52,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:04:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2019-12-07 20:04:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:04:52,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:52,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:52,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:52,583 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:52,584 INFO L82 PathProgramCache]: Analyzing trace with hash -473080754, now seen corresponding path program 1 times [2019-12-07 20:04:52,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:52,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689571137] [2019-12-07 20:04:52,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:52,738 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 20:04:52,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689571137] [2019-12-07 20:04:52,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238589103] [2019-12-07 20:04:52,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:04:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:52,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:04:52,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:52,820 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:52,864 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 20:04:52,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:04:52,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2019-12-07 20:04:52,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421928184] [2019-12-07 20:04:52,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:04:52,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:52,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:04:52,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:04:52,865 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 6 states. [2019-12-07 20:04:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:52,900 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-12-07 20:04:52,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:04:52,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 20:04:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:52,900 INFO L225 Difference]: With dead ends: 34 [2019-12-07 20:04:52,900 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 20:04:52,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:04:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 20:04:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 20:04:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 20:04:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-12-07 20:04:52,903 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 7 [2019-12-07 20:04:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:52,903 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-12-07 20:04:52,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:04:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-12-07 20:04:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:04:52,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:52,903 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-12-07 20:04:53,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:53,105 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:53,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash -377493813, now seen corresponding path program 1 times [2019-12-07 20:04:53,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:53,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083270459] [2019-12-07 20:04:53,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:53,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083270459] [2019-12-07 20:04:53,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224584405] [2019-12-07 20:04:53,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:04:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:53,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:04:53,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:53,355 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:53,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [43570904] [2019-12-07 20:04:53,417 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2019-12-07 20:04:53,417 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:04:53,418 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:04:53,418 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:04:53,418 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:04:53,509 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:04:53,705 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-12-07 20:04:53,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:04:53,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 5, 5] total 12 [2019-12-07 20:04:53,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721167242] [2019-12-07 20:04:53,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:04:53,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:53,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:04:53,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:04:53,707 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2019-12-07 20:04:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:53,762 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-12-07 20:04:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:04:53,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 20:04:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:53,762 INFO L225 Difference]: With dead ends: 34 [2019-12-07 20:04:53,762 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 20:04:53,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:04:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 20:04:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-12-07 20:04:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 20:04:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-12-07 20:04:53,765 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2019-12-07 20:04:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:53,765 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-12-07 20:04:53,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:04:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-12-07 20:04:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:04:53,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:53,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:53,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:53,966 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1780601482, now seen corresponding path program 1 times [2019-12-07 20:04:53,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:53,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372125290] [2019-12-07 20:04:53,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:04:53,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372125290] [2019-12-07 20:04:53,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:53,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:04:53,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31974082] [2019-12-07 20:04:53,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:04:53,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:53,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:04:53,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:04:53,997 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2019-12-07 20:04:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:54,015 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-12-07 20:04:54,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:04:54,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 20:04:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:54,015 INFO L225 Difference]: With dead ends: 32 [2019-12-07 20:04:54,015 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 20:04:54,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 20:04:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 20:04:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-07 20:04:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 20:04:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-12-07 20:04:54,017 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 8 [2019-12-07 20:04:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:54,018 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-12-07 20:04:54,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:04:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-12-07 20:04:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:04:54,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:54,018 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:54,018 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash 633342444, now seen corresponding path program 1 times [2019-12-07 20:04:54,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:54,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583071174] [2019-12-07 20:04:54,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:04:54,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583071174] [2019-12-07 20:04:54,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109906685] [2019-12-07 20:04:54,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:04:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:54,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:04:54,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:04:54,118 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:04:54,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2100105860] [2019-12-07 20:04:54,163 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 20:04:54,164 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:04:54,164 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:04:54,164 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:04:54,164 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:04:54,223 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:04:54,240 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:04:54,459 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:04:54,468 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:04:54,502 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:04:54,598 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:04:55,201 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-12-07 20:04:55,503 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-12-07 20:04:55,616 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:04:55,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:04:55,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2019-12-07 20:04:55,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572635133] [2019-12-07 20:04:55,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:04:55,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:04:55,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:04:55,617 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 10 states. [2019-12-07 20:04:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:55,764 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2019-12-07 20:04:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:04:55,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-12-07 20:04:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:55,765 INFO L225 Difference]: With dead ends: 76 [2019-12-07 20:04:55,765 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 20:04:55,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:04:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 20:04:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 29. [2019-12-07 20:04:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 20:04:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-12-07 20:04:55,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2019-12-07 20:04:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:55,767 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-12-07 20:04:55,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:04:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-12-07 20:04:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:04:55,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:55,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:55,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:04:55,969 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1760979527, now seen corresponding path program 1 times [2019-12-07 20:04:55,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:55,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957618803] [2019-12-07 20:04:55,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:56,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957618803] [2019-12-07 20:04:56,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:56,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:04:56,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096475857] [2019-12-07 20:04:56,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:04:56,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:56,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:04:56,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:04:56,026 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2019-12-07 20:04:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:56,064 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-12-07 20:04:56,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:04:56,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 20:04:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:56,065 INFO L225 Difference]: With dead ends: 27 [2019-12-07 20:04:56,065 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 20:04:56,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:04:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 20:04:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-12-07 20:04:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 20:04:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-12-07 20:04:56,067 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 10 [2019-12-07 20:04:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:56,067 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-12-07 20:04:56,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:04:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-12-07 20:04:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:04:56,068 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:56,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:56,068 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1760979526, now seen corresponding path program 1 times [2019-12-07 20:04:56,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:56,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894945210] [2019-12-07 20:04:56,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:56,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894945210] [2019-12-07 20:04:56,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:56,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:04:56,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111182162] [2019-12-07 20:04:56,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:04:56,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:56,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:04:56,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:04:56,109 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 6 states. [2019-12-07 20:04:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:56,163 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-12-07 20:04:56,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:04:56,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 20:04:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:56,164 INFO L225 Difference]: With dead ends: 39 [2019-12-07 20:04:56,164 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 20:04:56,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:04:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 20:04:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-12-07 20:04:56,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 20:04:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-12-07 20:04:56,166 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 10 [2019-12-07 20:04:56,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:56,166 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-12-07 20:04:56,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:04:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-12-07 20:04:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:04:56,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:56,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:56,167 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:56,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1244253620, now seen corresponding path program 1 times [2019-12-07 20:04:56,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:56,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898488780] [2019-12-07 20:04:56,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:04:56,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898488780] [2019-12-07 20:04:56,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:04:56,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:04:56,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32311519] [2019-12-07 20:04:56,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:04:56,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:04:56,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:04:56,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:04:56,287 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 7 states. [2019-12-07 20:04:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:04:56,363 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-12-07 20:04:56,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:04:56,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-07 20:04:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:04:56,364 INFO L225 Difference]: With dead ends: 45 [2019-12-07 20:04:56,364 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 20:04:56,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:04:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 20:04:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-12-07 20:04:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 20:04:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-12-07 20:04:56,366 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 11 [2019-12-07 20:04:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:04:56,366 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-12-07 20:04:56,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:04:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-12-07 20:04:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:04:56,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:04:56,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:04:56,367 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:04:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:04:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash -84209165, now seen corresponding path program 1 times [2019-12-07 20:04:56,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:04:56,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850596309] [2019-12-07 20:04:56,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:04:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:56,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850596309] [2019-12-07 20:04:56,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26527381] [2019-12-07 20:04:56,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:04:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:04:56,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 20:04:56,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:04:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:56,550 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:04:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:04:56,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [347583687] [2019-12-07 20:04:56,635 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:04:56,636 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:04:56,636 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:04:56,636 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:04:56,636 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:04:56,711 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:04:56,726 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:04:57,246 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:04:57,622 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:04:57,920 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-12-07 20:04:58,105 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-12-07 20:04:58,531 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 20:04:59,006 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-12-07 20:04:59,228 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:04:59,974 WARN L192 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:05:00,186 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:05:00,187 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:05:00,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:05:00,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2019-12-07 20:05:00,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560595547] [2019-12-07 20:05:00,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 20:05:00,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:00,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 20:05:00,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:05:00,188 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 20 states. [2019-12-07 20:05:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:00,611 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-12-07 20:05:00,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:05:00,612 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 12 [2019-12-07 20:05:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:00,612 INFO L225 Difference]: With dead ends: 57 [2019-12-07 20:05:00,612 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 20:05:00,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 20:05:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 20:05:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 38. [2019-12-07 20:05:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 20:05:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2019-12-07 20:05:00,614 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 12 [2019-12-07 20:05:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:00,615 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2019-12-07 20:05:00,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 20:05:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2019-12-07 20:05:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:05:00,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:00,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:00,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:00,816 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1684481690, now seen corresponding path program 1 times [2019-12-07 20:05:00,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:00,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925386040] [2019-12-07 20:05:00,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:00,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925386040] [2019-12-07 20:05:00,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:05:00,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:05:00,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926161905] [2019-12-07 20:05:00,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:05:00,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:05:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:05:00,864 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 5 states. [2019-12-07 20:05:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:00,898 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-12-07 20:05:00,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:05:00,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 20:05:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:00,899 INFO L225 Difference]: With dead ends: 37 [2019-12-07 20:05:00,899 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 20:05:00,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:05:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 20:05:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 20:05:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 20:05:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2019-12-07 20:05:00,900 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 13 [2019-12-07 20:05:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:00,901 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-12-07 20:05:00,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:05:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2019-12-07 20:05:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:05:00,901 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:00,901 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:00,901 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1684481691, now seen corresponding path program 1 times [2019-12-07 20:05:00,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:00,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639710197] [2019-12-07 20:05:00,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:00,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639710197] [2019-12-07 20:05:00,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:05:00,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:05:00,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462395392] [2019-12-07 20:05:00,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:05:00,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:00,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:05:00,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:05:00,945 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 6 states. [2019-12-07 20:05:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:01,009 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-12-07 20:05:01,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:05:01,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 20:05:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:01,011 INFO L225 Difference]: With dead ends: 41 [2019-12-07 20:05:01,011 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 20:05:01,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:05:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 20:05:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-12-07 20:05:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 20:05:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-12-07 20:05:01,014 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 13 [2019-12-07 20:05:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:01,014 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-12-07 20:05:01,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:05:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-12-07 20:05:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:05:01,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:01,015 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:01,015 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash 679371756, now seen corresponding path program 2 times [2019-12-07 20:05:01,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:01,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010054963] [2019-12-07 20:05:01,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:01,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010054963] [2019-12-07 20:05:01,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317914676] [2019-12-07 20:05:01,176 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:05:01,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:05:01,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:05:01,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 20:05:01,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:05:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:01,409 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:05:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:01,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1922789788] [2019-12-07 20:05:01,534 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:05:01,535 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:05:01,535 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:05:01,535 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:05:01,535 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:05:02,002 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:05:02,423 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:05:03,092 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-12-07 20:05:03,380 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:05:04,145 WARN L192 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:05:04,376 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:05:04,377 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:05:04,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:05:04,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 20 [2019-12-07 20:05:04,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220771480] [2019-12-07 20:05:04,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 20:05:04,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 20:05:04,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-12-07 20:05:04,378 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 21 states. [2019-12-07 20:05:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:05,088 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-12-07 20:05:05,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:05:05,088 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 14 [2019-12-07 20:05:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:05,089 INFO L225 Difference]: With dead ends: 70 [2019-12-07 20:05:05,089 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 20:05:05,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 20:05:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 20:05:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2019-12-07 20:05:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 20:05:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-12-07 20:05:05,092 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 14 [2019-12-07 20:05:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:05,092 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-12-07 20:05:05,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 20:05:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-12-07 20:05:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:05:05,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:05,093 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:05,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:05,294 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash -781735509, now seen corresponding path program 3 times [2019-12-07 20:05:05,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:05,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227027602] [2019-12-07 20:05:05,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:05:05,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227027602] [2019-12-07 20:05:05,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014108997] [2019-12-07 20:05:05,372 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:05:05,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 20:05:05,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:05:05,415 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 20:05:05,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:05:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:05:05,719 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:05:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:05:06,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1520620023] [2019-12-07 20:05:06,064 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:05:06,064 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:05:06,064 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:05:06,064 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:05:06,065 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:05:06,111 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:06,483 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:05:06,910 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:05:07,681 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-12-07 20:05:08,137 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:05:09,173 WARN L192 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:05:09,400 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:05:09,401 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:05:09,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:05:09,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2019-12-07 20:05:09,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986560184] [2019-12-07 20:05:09,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 20:05:09,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:09,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 20:05:09,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 20:05:09,402 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 30 states. [2019-12-07 20:05:09,968 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-12-07 20:05:11,456 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-07 20:05:11,900 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-12-07 20:05:12,911 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-07 20:05:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:12,990 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2019-12-07 20:05:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 20:05:12,990 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 16 [2019-12-07 20:05:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:12,992 INFO L225 Difference]: With dead ends: 204 [2019-12-07 20:05:12,992 INFO L226 Difference]: Without dead ends: 204 [2019-12-07 20:05:12,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=987, Invalid=3983, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 20:05:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-12-07 20:05:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 57. [2019-12-07 20:05:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 20:05:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2019-12-07 20:05:12,997 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 16 [2019-12-07 20:05:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:12,997 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2019-12-07 20:05:12,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 20:05:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2019-12-07 20:05:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:05:12,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:12,998 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:13,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:13,200 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash 371453348, now seen corresponding path program 4 times [2019-12-07 20:05:13,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:13,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953882421] [2019-12-07 20:05:13,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:13,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953882421] [2019-12-07 20:05:13,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349827954] [2019-12-07 20:05:13,498 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:05:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:13,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 20:05:13,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:05:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:13,843 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:05:14,161 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:14,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009518001] [2019-12-07 20:05:14,162 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:05:14,162 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:05:14,162 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:05:14,162 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:05:14,162 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:05:14,415 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:14,422 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:14,427 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:14,686 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:05:14,919 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 20:05:15,432 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-12-07 20:05:15,824 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2019-12-07 20:05:16,105 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2019-12-07 20:05:16,301 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-07 20:05:17,825 WARN L192 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-12-07 20:05:18,071 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:05:18,072 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:05:18,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:05:18,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-12-07 20:05:18,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830498798] [2019-12-07 20:05:18,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 20:05:18,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:18,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 20:05:18,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 20:05:18,074 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 32 states. [2019-12-07 20:05:20,119 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-12-07 20:05:20,402 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-12-07 20:05:21,595 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-12-07 20:05:23,373 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-12-07 20:05:23,551 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-12-07 20:05:25,409 WARN L192 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-12-07 20:05:25,613 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-07 20:05:25,809 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-12-07 20:05:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:26,073 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2019-12-07 20:05:26,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 20:05:26,073 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 18 [2019-12-07 20:05:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:26,074 INFO L225 Difference]: With dead ends: 119 [2019-12-07 20:05:26,074 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 20:05:26,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=614, Invalid=3168, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 20:05:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 20:05:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 66. [2019-12-07 20:05:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 20:05:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2019-12-07 20:05:26,077 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 18 [2019-12-07 20:05:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:26,077 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2019-12-07 20:05:26,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 20:05:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2019-12-07 20:05:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:05:26,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:26,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:26,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:26,279 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash 645154981, now seen corresponding path program 1 times [2019-12-07 20:05:26,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:26,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609215357] [2019-12-07 20:05:26,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:26,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609215357] [2019-12-07 20:05:26,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:05:26,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:05:26,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092970444] [2019-12-07 20:05:26,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:05:26,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:26,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:05:26,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:05:26,322 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 4 states. [2019-12-07 20:05:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:26,338 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-12-07 20:05:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:05:26,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 20:05:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:26,339 INFO L225 Difference]: With dead ends: 65 [2019-12-07 20:05:26,339 INFO L226 Difference]: Without dead ends: 62 [2019-12-07 20:05:26,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:05:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-07 20:05:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 20:05:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 20:05:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2019-12-07 20:05:26,340 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 18 [2019-12-07 20:05:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:26,340 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2019-12-07 20:05:26,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:05:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2019-12-07 20:05:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:05:26,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:26,341 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:26,341 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:26,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:26,341 INFO L82 PathProgramCache]: Analyzing trace with hash 646013714, now seen corresponding path program 1 times [2019-12-07 20:05:26,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:26,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934536065] [2019-12-07 20:05:26,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:05:26,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934536065] [2019-12-07 20:05:26,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093582958] [2019-12-07 20:05:26,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:26,497 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 20:05:26,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:05:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:26,682 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:05:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:26,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1207021950] [2019-12-07 20:05:26,872 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 20:05:26,872 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:05:26,873 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:05:26,873 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:05:26,873 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:05:27,210 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:05:28,056 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:05:28,329 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-12-07 20:05:28,623 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98 [2019-12-07 20:05:28,937 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 20:05:29,292 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2019-12-07 20:05:29,688 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 107 [2019-12-07 20:05:29,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:05:29,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8, 8, 8] total 34 [2019-12-07 20:05:29,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516279494] [2019-12-07 20:05:29,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 20:05:29,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 20:05:29,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 20:05:29,826 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 14 states. [2019-12-07 20:05:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:30,134 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2019-12-07 20:05:30,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:05:30,135 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-12-07 20:05:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:30,136 INFO L225 Difference]: With dead ends: 119 [2019-12-07 20:05:30,136 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 20:05:30,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 20:05:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 20:05:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-12-07 20:05:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 20:05:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-12-07 20:05:30,139 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 18 [2019-12-07 20:05:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:30,140 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-12-07 20:05:30,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 20:05:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2019-12-07 20:05:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:05:30,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:30,141 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:30,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:30,342 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:30,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:30,343 INFO L82 PathProgramCache]: Analyzing trace with hash -110740509, now seen corresponding path program 5 times [2019-12-07 20:05:30,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:30,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457227872] [2019-12-07 20:05:30,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:05:30,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457227872] [2019-12-07 20:05:30,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655169300] [2019-12-07 20:05:30,453 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:05:30,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 20:05:30,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:05:30,500 INFO L264 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 20:05:30,502 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:05:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:05:30,891 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:05:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:05:31,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1162882174] [2019-12-07 20:05:31,439 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:05:31,439 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:05:31,440 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:05:31,440 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:05:31,440 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:05:31,507 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:31,856 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:05:32,305 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:05:33,218 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-12-07 20:05:33,724 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:05:34,945 WARN L192 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:05:35,645 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:05:35,646 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:05:35,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:05:35,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 35 [2019-12-07 20:05:35,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25503812] [2019-12-07 20:05:35,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 20:05:35,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:35,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 20:05:35,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1859, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 20:05:35,649 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 36 states. [2019-12-07 20:05:37,580 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 46 [2019-12-07 20:05:38,653 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-12-07 20:05:39,094 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-12-07 20:05:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:40,486 INFO L93 Difference]: Finished difference Result 211 states and 233 transitions. [2019-12-07 20:05:40,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 20:05:40,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 20 [2019-12-07 20:05:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:40,487 INFO L225 Difference]: With dead ends: 211 [2019-12-07 20:05:40,487 INFO L226 Difference]: Without dead ends: 209 [2019-12-07 20:05:40,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1277, Invalid=5365, Unknown=0, NotChecked=0, Total=6642 [2019-12-07 20:05:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-07 20:05:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 84. [2019-12-07 20:05:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 20:05:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2019-12-07 20:05:40,493 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 20 [2019-12-07 20:05:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:40,493 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2019-12-07 20:05:40,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 20:05:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2019-12-07 20:05:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:05:40,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:40,494 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:40,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:40,695 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:40,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1769948700, now seen corresponding path program 1 times [2019-12-07 20:05:40,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:40,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302144143] [2019-12-07 20:05:40,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:40,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302144143] [2019-12-07 20:05:40,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775948763] [2019-12-07 20:05:40,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:40,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 20:05:40,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:05:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:40,892 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:05:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:40,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [415487028] [2019-12-07 20:05:40,987 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 20:05:40,988 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:05:40,988 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:05:40,988 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:05:40,988 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:05:41,227 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:41,235 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:41,241 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:41,423 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:05:41,430 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:05:41,709 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:05:41,786 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:05:42,007 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-12-07 20:05:42,505 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-12-07 20:05:43,289 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-12-07 20:05:43,554 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2019-12-07 20:05:43,838 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 99 [2019-12-07 20:05:44,490 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 20:05:44,674 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 20:05:44,674 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:05:44,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:05:44,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2019-12-07 20:05:44,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134842273] [2019-12-07 20:05:44,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 20:05:44,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 20:05:44,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 20:05:44,676 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand 20 states. [2019-12-07 20:05:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:05:45,774 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2019-12-07 20:05:45,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:05:45,775 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-12-07 20:05:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:05:45,779 INFO L225 Difference]: With dead ends: 143 [2019-12-07 20:05:45,779 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 20:05:45,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=261, Invalid=1809, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 20:05:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 20:05:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 108. [2019-12-07 20:05:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 20:05:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2019-12-07 20:05:45,789 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 20 [2019-12-07 20:05:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:05:45,789 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2019-12-07 20:05:45,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 20:05:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2019-12-07 20:05:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:05:45,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:05:45,790 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:05:45,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:45,991 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:05:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:05:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash 952553948, now seen corresponding path program 6 times [2019-12-07 20:05:45,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:05:45,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386794936] [2019-12-07 20:05:45,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:05:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:05:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:46,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386794936] [2019-12-07 20:05:46,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344363158] [2019-12-07 20:05:46,498 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:05:46,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 20:05:46,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:05:46,539 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-07 20:05:46,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:05:47,642 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-12-07 20:05:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:47,759 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:05:48,532 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-12-07 20:05:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:05:49,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1222047159] [2019-12-07 20:05:49,342 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:05:49,343 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:05:49,343 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:05:49,343 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:05:49,343 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:05:49,596 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:49,603 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:49,629 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:05:49,881 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:05:50,129 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 20:05:50,758 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-12-07 20:05:51,141 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2019-12-07 20:05:51,418 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 64 [2019-12-07 20:05:51,749 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-07 20:05:52,443 WARN L192 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-12-07 20:05:52,710 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:05:52,711 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:05:52,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:05:52,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 40 [2019-12-07 20:05:52,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261031908] [2019-12-07 20:05:52,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 20:05:52,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:05:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 20:05:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2235, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 20:05:52,713 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand 41 states. [2019-12-07 20:05:55,066 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-12-07 20:05:55,635 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 73 [2019-12-07 20:06:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:06:00,035 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2019-12-07 20:06:00,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 20:06:00,035 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 22 [2019-12-07 20:06:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:06:00,036 INFO L225 Difference]: With dead ends: 230 [2019-12-07 20:06:00,036 INFO L226 Difference]: Without dead ends: 230 [2019-12-07 20:06:00,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1008, Invalid=5154, Unknown=0, NotChecked=0, Total=6162 [2019-12-07 20:06:00,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-12-07 20:06:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 125. [2019-12-07 20:06:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 20:06:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2019-12-07 20:06:00,041 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 150 transitions. Word has length 22 [2019-12-07 20:06:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:06:00,041 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 150 transitions. [2019-12-07 20:06:00,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 20:06:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2019-12-07 20:06:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:06:00,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:06:00,042 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:06:00,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:00,243 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:06:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:06:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1314607306, now seen corresponding path program 1 times [2019-12-07 20:06:00,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:06:00,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087616708] [2019-12-07 20:06:00,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:06:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:06:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:06:00,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087616708] [2019-12-07 20:06:00,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116201087] [2019-12-07 20:06:00,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:06:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:06:00,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 20:06:00,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:06:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:06:00,823 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:06:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:06:01,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1413264440] [2019-12-07 20:06:01,051 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 20:06:01,051 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:06:01,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:06:01,051 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:06:01,051 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:06:01,686 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:06:01,924 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-12-07 20:06:02,881 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:06:03,657 WARN L192 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:06:03,890 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:06:04,122 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-12-07 20:06:04,376 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-12-07 20:06:04,665 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-12-07 20:06:04,993 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-12-07 20:06:05,415 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-12-07 20:06:05,416 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:06:05,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:06:05,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2019-12-07 20:06:05,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276458977] [2019-12-07 20:06:05,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 20:06:05,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:06:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 20:06:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 20:06:05,417 INFO L87 Difference]: Start difference. First operand 125 states and 150 transitions. Second operand 26 states. [2019-12-07 20:06:06,768 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2019-12-07 20:06:07,108 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-12-07 20:06:07,297 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-12-07 20:06:07,827 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-12-07 20:06:08,117 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 20:06:08,788 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-07 20:06:09,587 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 20:06:09,955 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-12-07 20:06:10,925 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-12-07 20:06:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:06:11,452 INFO L93 Difference]: Finished difference Result 212 states and 237 transitions. [2019-12-07 20:06:11,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 20:06:11,453 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 22 [2019-12-07 20:06:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:06:11,456 INFO L225 Difference]: With dead ends: 212 [2019-12-07 20:06:11,456 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 20:06:11,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=822, Invalid=5498, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 20:06:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 20:06:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 111. [2019-12-07 20:06:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 20:06:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2019-12-07 20:06:11,470 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 22 [2019-12-07 20:06:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:06:11,470 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2019-12-07 20:06:11,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 20:06:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2019-12-07 20:06:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:06:11,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:06:11,472 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:06:11,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:11,673 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:06:11,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:06:11,674 INFO L82 PathProgramCache]: Analyzing trace with hash -106305381, now seen corresponding path program 7 times [2019-12-07 20:06:11,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:06:11,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436926676] [2019-12-07 20:06:11,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:06:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:06:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:06:11,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436926676] [2019-12-07 20:06:11,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103856766] [2019-12-07 20:06:11,795 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:06:11,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 20:06:11,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:06:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:06:11,997 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:06:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:06:12,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [205235197] [2019-12-07 20:06:12,300 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:06:12,300 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:06:12,301 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:06:12,301 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:06:12,301 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:06:12,716 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:06:13,164 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:06:13,977 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-12-07 20:06:14,222 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:06:15,027 WARN L192 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:06:15,289 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:06:15,290 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:06:15,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:06:15,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2019-12-07 20:06:15,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020136092] [2019-12-07 20:06:15,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 20:06:15,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:06:15,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 20:06:15,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 20:06:15,291 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand 37 states. [2019-12-07 20:06:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:06:16,811 INFO L93 Difference]: Finished difference Result 217 states and 240 transitions. [2019-12-07 20:06:16,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 20:06:16,812 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 24 [2019-12-07 20:06:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:06:16,813 INFO L225 Difference]: With dead ends: 217 [2019-12-07 20:06:16,813 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 20:06:16,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=566, Invalid=3094, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 20:06:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 20:06:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 125. [2019-12-07 20:06:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 20:06:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 146 transitions. [2019-12-07 20:06:16,820 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 146 transitions. Word has length 24 [2019-12-07 20:06:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:06:16,820 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 146 transitions. [2019-12-07 20:06:16,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 20:06:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 146 transitions. [2019-12-07 20:06:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:06:16,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:06:16,821 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:06:17,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:17,022 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:06:17,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:06:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1843875572, now seen corresponding path program 1 times [2019-12-07 20:06:17,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:06:17,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765260440] [2019-12-07 20:06:17,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:06:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:06:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:06:17,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765260440] [2019-12-07 20:06:17,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441626751] [2019-12-07 20:06:17,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:06:17,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:06:17,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:06:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:06:17,162 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:06:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 20:06:17,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [386538488] [2019-12-07 20:06:17,193 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-12-07 20:06:17,193 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:06:17,193 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:06:17,193 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:06:17,193 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:06:17,242 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:06:17,247 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:06:17,262 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:06:17,573 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:06:17,579 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:06:17,861 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:06:17,948 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:06:18,209 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2019-12-07 20:06:18,439 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-07 20:06:18,652 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-07 20:06:18,853 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-12-07 20:06:19,063 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-07 20:06:19,327 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 20:06:19,714 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-12-07 20:06:20,161 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2019-12-07 20:06:20,650 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 99 [2019-12-07 20:06:21,245 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 20:06:21,470 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 20:06:21,677 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 20:06:21,677 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:06:21,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:06:21,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2019-12-07 20:06:21,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362381501] [2019-12-07 20:06:21,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:06:21,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:06:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:06:21,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:06:21,679 INFO L87 Difference]: Start difference. First operand 125 states and 146 transitions. Second operand 13 states. [2019-12-07 20:06:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:06:21,778 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2019-12-07 20:06:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:06:21,778 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-12-07 20:06:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:06:21,779 INFO L225 Difference]: With dead ends: 120 [2019-12-07 20:06:21,779 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 20:06:21,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 20:06:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 20:06:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-12-07 20:06:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 20:06:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2019-12-07 20:06:21,781 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 24 [2019-12-07 20:06:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:06:21,781 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2019-12-07 20:06:21,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 20:06:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2019-12-07 20:06:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 20:06:21,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:06:21,782 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:06:21,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:21,983 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:06:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:06:21,983 INFO L82 PathProgramCache]: Analyzing trace with hash 919744660, now seen corresponding path program 8 times [2019-12-07 20:06:21,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:06:21,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432675191] [2019-12-07 20:06:21,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:06:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:06:22,477 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-12-07 20:06:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:06:23,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432675191] [2019-12-07 20:06:23,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527737953] [2019-12-07 20:06:23,353 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:23,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 20:06:23,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:06:23,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-07 20:06:23,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:06:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:06:24,324 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:06:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:06:25,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1583767452] [2019-12-07 20:06:25,246 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:06:25,246 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:06:25,246 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:06:25,246 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:06:25,246 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:06:25,291 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:06:25,682 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:06:26,169 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:06:26,603 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2019-12-07 20:06:27,063 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-07 20:06:27,519 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-07 20:06:27,832 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-12-07 20:06:28,090 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 20:06:28,431 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-12-07 20:06:28,945 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:06:29,966 WARN L192 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:06:30,247 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:06:30,248 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:06:30,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:06:30,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2019-12-07 20:06:30,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143340094] [2019-12-07 20:06:30,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-07 20:06:30,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:06:30,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-07 20:06:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3061, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 20:06:30,250 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 48 states. [2019-12-07 20:06:32,204 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-12-07 20:06:32,579 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2019-12-07 20:06:33,250 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-12-07 20:06:33,965 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2019-12-07 20:06:34,138 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-12-07 20:06:35,861 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 92 [2019-12-07 20:06:38,402 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-12-07 20:06:39,429 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 93 [2019-12-07 20:06:39,599 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-12-07 20:06:39,859 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 98 [2019-12-07 20:06:41,564 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2019-12-07 20:06:44,106 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-12-07 20:06:46,395 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-12-07 20:06:46,585 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2019-12-07 20:06:47,524 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2019-12-07 20:06:47,686 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-12-07 20:06:48,075 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 103 [2019-12-07 20:06:48,530 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-12-07 20:06:50,219 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2019-12-07 20:06:52,015 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2019-12-07 20:06:53,194 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 [2019-12-07 20:06:53,381 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-12-07 20:06:53,934 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-12-07 20:06:55,660 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 102 [2019-12-07 20:06:56,121 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2019-12-07 20:06:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:06:56,813 INFO L93 Difference]: Finished difference Result 340 states and 377 transitions. [2019-12-07 20:06:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-07 20:06:56,813 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 26 [2019-12-07 20:06:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:06:56,815 INFO L225 Difference]: With dead ends: 340 [2019-12-07 20:06:56,815 INFO L226 Difference]: Without dead ends: 340 [2019-12-07 20:06:56,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=1861, Invalid=11244, Unknown=5, NotChecked=0, Total=13110 [2019-12-07 20:06:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-12-07 20:06:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 134. [2019-12-07 20:06:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-07 20:06:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2019-12-07 20:06:56,818 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 26 [2019-12-07 20:06:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:06:56,819 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2019-12-07 20:06:56,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-07 20:06:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2019-12-07 20:06:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:06:56,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:06:56,819 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:06:57,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:57,020 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:06:57,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:06:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash 730952266, now seen corresponding path program 2 times [2019-12-07 20:06:57,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:06:57,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671249091] [2019-12-07 20:06:57,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:06:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:06:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:06:57,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671249091] [2019-12-07 20:06:57,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493472903] [2019-12-07 20:06:57,221 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:06:57,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:06:57,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:06:57,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 20:06:57,266 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:06:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:06:57,438 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:06:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:06:57,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [32061482] [2019-12-07 20:06:57,632 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 20:06:57,632 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:06:57,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:06:57,632 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:06:57,632 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:06:57,694 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:06:57,995 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:06:58,001 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:06:58,275 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:06:58,352 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:06:58,582 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-12-07 20:06:59,418 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-07 20:06:59,916 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-12-07 20:07:00,265 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 20:07:00,746 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-12-07 20:07:01,152 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2019-12-07 20:07:01,464 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 99 [2019-12-07 20:07:02,011 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 20:07:02,204 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 20:07:02,402 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 20:07:02,403 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:07:02,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:07:02,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 29 [2019-12-07 20:07:02,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670619330] [2019-12-07 20:07:02,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 20:07:02,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:07:02,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 20:07:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1789, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 20:07:02,404 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand 29 states. [2019-12-07 20:07:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:07:04,003 INFO L93 Difference]: Finished difference Result 301 states and 339 transitions. [2019-12-07 20:07:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 20:07:04,003 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 27 [2019-12-07 20:07:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:07:04,004 INFO L225 Difference]: With dead ends: 301 [2019-12-07 20:07:04,004 INFO L226 Difference]: Without dead ends: 225 [2019-12-07 20:07:04,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=670, Invalid=4586, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 20:07:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-12-07 20:07:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 154. [2019-12-07 20:07:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 20:07:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2019-12-07 20:07:04,007 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 27 [2019-12-07 20:07:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:07:04,008 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2019-12-07 20:07:04,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 20:07:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2019-12-07 20:07:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 20:07:04,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:07:04,008 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:07:04,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:07:04,210 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:07:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:07:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 247320531, now seen corresponding path program 9 times [2019-12-07 20:07:04,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:07:04,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571183708] [2019-12-07 20:07:04,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:07:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:07:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:07:04,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571183708] [2019-12-07 20:07:04,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105644323] [2019-12-07 20:07:04,346 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:07:04,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 20:07:04,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:07:04,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 20:07:04,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:07:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:07:04,599 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:07:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:07:04,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1471705327] [2019-12-07 20:07:04,899 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:07:04,899 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:07:04,899 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:07:04,899 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:07:04,899 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:07:04,972 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:07:05,350 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:07:05,818 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:07:06,873 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:07:07,683 WARN L192 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:07:07,922 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:07:07,923 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:07:07,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:07:07,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2019-12-07 20:07:07,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97483060] [2019-12-07 20:07:07,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 20:07:07,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:07:07,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 20:07:07,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2468, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 20:07:07,924 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand 43 states. [2019-12-07 20:07:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:07:08,780 INFO L93 Difference]: Finished difference Result 294 states and 328 transitions. [2019-12-07 20:07:08,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 20:07:08,781 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 28 [2019-12-07 20:07:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:07:08,782 INFO L225 Difference]: With dead ends: 294 [2019-12-07 20:07:08,782 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 20:07:08,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=654, Invalid=3636, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 20:07:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 20:07:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 170. [2019-12-07 20:07:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 20:07:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 197 transitions. [2019-12-07 20:07:08,785 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 197 transitions. Word has length 28 [2019-12-07 20:07:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:07:08,785 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 197 transitions. [2019-12-07 20:07:08,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 20:07:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 197 transitions. [2019-12-07 20:07:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 20:07:08,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:07:08,786 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:07:08,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:07:08,987 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:07:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:07:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1985185508, now seen corresponding path program 2 times [2019-12-07 20:07:08,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:07:08,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628606678] [2019-12-07 20:07:08,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:07:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:07:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:07:09,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628606678] [2019-12-07 20:07:09,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815073716] [2019-12-07 20:07:09,067 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:07:09,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:07:09,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:07:09,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 20:07:09,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:07:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:07:09,206 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:07:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:07:09,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509345135] [2019-12-07 20:07:09,296 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 20:07:09,296 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:07:09,296 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:07:09,296 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:07:09,296 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:07:09,348 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:07:09,354 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:07:09,359 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:07:09,561 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:07:09,591 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:07:09,597 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:07:10,072 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:07:10,288 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-12-07 20:07:10,628 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-12-07 20:07:10,929 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2019-12-07 20:07:11,136 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2019-12-07 20:07:11,308 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-07 20:07:11,692 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2019-12-07 20:07:11,903 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:07:12,119 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-12-07 20:07:12,460 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-12-07 20:07:12,878 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-12-07 20:07:13,341 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-12-07 20:07:13,764 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 100 [2019-12-07 20:07:13,765 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:07:13,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:07:13,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2019-12-07 20:07:13,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498890291] [2019-12-07 20:07:13,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 20:07:13,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:07:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 20:07:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 20:07:13,766 INFO L87 Difference]: Start difference. First operand 170 states and 197 transitions. Second operand 22 states. [2019-12-07 20:07:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:07:14,040 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2019-12-07 20:07:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:07:14,040 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-12-07 20:07:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:07:14,041 INFO L225 Difference]: With dead ends: 225 [2019-12-07 20:07:14,041 INFO L226 Difference]: Without dead ends: 179 [2019-12-07 20:07:14,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=251, Invalid=1555, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 20:07:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-12-07 20:07:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-12-07 20:07:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 20:07:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2019-12-07 20:07:14,043 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 29 [2019-12-07 20:07:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:07:14,043 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2019-12-07 20:07:14,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 20:07:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2019-12-07 20:07:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 20:07:14,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:07:14,044 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:07:14,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:07:14,246 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:07:14,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:07:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1451829708, now seen corresponding path program 10 times [2019-12-07 20:07:14,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:07:14,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858078233] [2019-12-07 20:07:14,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:07:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:07:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:07:15,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858078233] [2019-12-07 20:07:15,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229578729] [2019-12-07 20:07:15,070 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:07:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:07:15,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 69 conjunts are in the unsatisfiable core [2019-12-07 20:07:15,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:07:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 15 proven. 36 refuted. 9 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:07:35,134 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:07:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 35 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:07:36,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420256732] [2019-12-07 20:07:36,226 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:07:36,226 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:07:36,226 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:07:36,226 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:07:36,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:07:36,654 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:07:37,196 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:07:38,483 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:07:39,491 WARN L192 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:07:39,828 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:07:39,829 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:07:39,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:07:39,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 56 [2019-12-07 20:07:39,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578665826] [2019-12-07 20:07:39,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-07 20:07:39,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:07:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-07 20:07:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=4078, Unknown=14, NotChecked=0, Total=4422 [2019-12-07 20:07:39,830 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 57 states. [2019-12-07 20:07:42,574 WARN L192 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-12-07 20:07:43,639 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78 [2019-12-07 20:07:44,133 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 89 [2019-12-07 20:07:45,201 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 20:07:45,497 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2019-12-07 20:07:45,975 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 88 [2019-12-07 20:07:46,555 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 104 [2019-12-07 20:07:47,281 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2019-12-07 20:07:49,067 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-12-07 20:07:49,482 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 107 [2019-12-07 20:07:49,752 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2019-12-07 20:07:50,026 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 90 [2019-12-07 20:07:50,340 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2019-12-07 20:07:52,765 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-12-07 20:07:54,171 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82 [2019-12-07 20:07:54,508 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 101 [2019-12-07 20:07:54,797 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 88 [2019-12-07 20:07:55,109 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 20:07:55,547 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 91 [2019-12-07 20:07:55,938 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 103 [2019-12-07 20:07:58,796 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-12-07 20:07:59,494 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 106 [2019-12-07 20:07:59,788 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2019-12-07 20:08:00,364 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 106 [2019-12-07 20:08:00,883 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 108 [2019-12-07 20:08:04,566 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 110 [2019-12-07 20:08:04,881 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-12-07 20:08:05,428 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 100 [2019-12-07 20:08:06,490 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 105 [2019-12-07 20:08:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:08:07,323 INFO L93 Difference]: Finished difference Result 388 states and 432 transitions. [2019-12-07 20:08:07,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-07 20:08:07,323 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 30 [2019-12-07 20:08:07,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:08:07,325 INFO L225 Difference]: With dead ends: 388 [2019-12-07 20:08:07,325 INFO L226 Difference]: Without dead ends: 362 [2019-12-07 20:08:07,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=1621, Invalid=11021, Unknown=14, NotChecked=0, Total=12656 [2019-12-07 20:08:07,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-07 20:08:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 188. [2019-12-07 20:08:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-12-07 20:08:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2019-12-07 20:08:07,328 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 30 [2019-12-07 20:08:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:08:07,328 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2019-12-07 20:08:07,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-07 20:08:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2019-12-07 20:08:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 20:08:07,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:08:07,329 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:08:07,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:08:07,531 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:08:07,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:08:07,531 INFO L82 PathProgramCache]: Analyzing trace with hash -100066471, now seen corresponding path program 3 times [2019-12-07 20:08:07,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:08:07,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925901552] [2019-12-07 20:08:07,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:08:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:08:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:08:07,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925901552] [2019-12-07 20:08:07,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795944382] [2019-12-07 20:08:07,637 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:08:07,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 20:08:07,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:08:07,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 20:08:07,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:08:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:08:07,787 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:08:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:08:07,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [181513392] [2019-12-07 20:08:07,902 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 20:08:07,902 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:08:07,902 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:08:07,902 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:08:07,902 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:08:08,142 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:08:08,149 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:08:08,179 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:08:08,339 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:08:08,346 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:08:08,626 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-12-07 20:08:08,703 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:08:08,917 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-12-07 20:08:09,373 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-12-07 20:08:09,529 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-12-07 20:08:09,727 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-12-07 20:08:09,984 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-07 20:08:10,560 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-12-07 20:08:10,911 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2019-12-07 20:08:11,412 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 99 [2019-12-07 20:08:11,663 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 20:08:11,996 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 20:08:12,229 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 20:08:12,429 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 20:08:12,430 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:08:12,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:08:12,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2019-12-07 20:08:12,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261837216] [2019-12-07 20:08:12,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 20:08:12,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:08:12,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 20:08:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 20:08:12,431 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 23 states. [2019-12-07 20:08:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:08:12,926 INFO L93 Difference]: Finished difference Result 229 states and 252 transitions. [2019-12-07 20:08:12,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:08:12,926 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2019-12-07 20:08:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:08:12,927 INFO L225 Difference]: With dead ends: 229 [2019-12-07 20:08:12,927 INFO L226 Difference]: Without dead ends: 229 [2019-12-07 20:08:12,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=329, Invalid=2221, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 20:08:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-12-07 20:08:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 209. [2019-12-07 20:08:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-07 20:08:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 240 transitions. [2019-12-07 20:08:12,931 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 240 transitions. Word has length 31 [2019-12-07 20:08:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:08:12,931 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 240 transitions. [2019-12-07 20:08:12,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 20:08:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 240 transitions. [2019-12-07 20:08:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 20:08:12,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:08:12,932 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:08:13,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:08:13,133 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:08:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:08:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash 84218251, now seen corresponding path program 11 times [2019-12-07 20:08:13,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:08:13,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350256110] [2019-12-07 20:08:13,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:08:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:08:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 27 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:08:13,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350256110] [2019-12-07 20:08:13,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096622363] [2019-12-07 20:08:13,314 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:08:13,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 20:08:13,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:08:13,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 20:08:13,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:08:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 25 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:08:14,077 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:08:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:08:15,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1020647781] [2019-12-07 20:08:15,087 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:08:15,087 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:08:15,087 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:08:15,087 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:08:15,087 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:08:15,138 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:08:15,352 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:08:15,359 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:08:15,365 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:08:15,604 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:08:15,869 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 20:08:16,643 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-12-07 20:08:17,067 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2019-12-07 20:08:17,374 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2019-12-07 20:08:17,593 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-07 20:08:18,311 WARN L192 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-12-07 20:08:18,939 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:08:18,941 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:08:18,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:08:18,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 53 [2019-12-07 20:08:18,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409421373] [2019-12-07 20:08:18,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 20:08:18,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:08:18,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 20:08:18,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=3508, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 20:08:18,943 INFO L87 Difference]: Start difference. First operand 209 states and 240 transitions. Second operand 54 states. [2019-12-07 20:08:19,930 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-07 20:08:21,427 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 20:08:22,043 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-12-07 20:08:22,464 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-12-07 20:08:22,823 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-12-07 20:08:23,558 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-12-07 20:08:26,574 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-12-07 20:08:26,864 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-12-07 20:08:27,435 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-12-07 20:08:27,772 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-12-07 20:08:28,315 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-07 20:08:28,734 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2019-12-07 20:08:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:08:29,110 INFO L93 Difference]: Finished difference Result 492 states and 538 transitions. [2019-12-07 20:08:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 20:08:29,110 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 32 [2019-12-07 20:08:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:08:29,112 INFO L225 Difference]: With dead ends: 492 [2019-12-07 20:08:29,112 INFO L226 Difference]: Without dead ends: 477 [2019-12-07 20:08:29,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2307 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=2547, Invalid=9885, Unknown=0, NotChecked=0, Total=12432 [2019-12-07 20:08:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-12-07 20:08:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 232. [2019-12-07 20:08:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-07 20:08:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 265 transitions. [2019-12-07 20:08:29,116 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 265 transitions. Word has length 32 [2019-12-07 20:08:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:08:29,116 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 265 transitions. [2019-12-07 20:08:29,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 20:08:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 265 transitions. [2019-12-07 20:08:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:08:29,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:08:29,117 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:08:29,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:08:29,318 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:08:29,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:08:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash -670638716, now seen corresponding path program 12 times [2019-12-07 20:08:29,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:08:29,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735256252] [2019-12-07 20:08:29,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:08:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:08:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:08:30,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735256252] [2019-12-07 20:08:30,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70858266] [2019-12-07 20:08:30,475 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:08:30,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 20:08:30,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:08:30,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 82 conjunts are in the unsatisfiable core [2019-12-07 20:08:30,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:08:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:08:31,921 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:08:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 48 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:08:33,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723911357] [2019-12-07 20:08:33,284 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:08:33,284 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:08:33,284 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:08:33,284 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:08:33,284 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:08:33,693 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:08:34,256 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 84 [2019-12-07 20:08:35,696 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-12-07 20:08:36,626 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 119 [2019-12-07 20:08:37,216 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:08:37,217 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:08:37,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:08:37,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 64 [2019-12-07 20:08:37,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771804450] [2019-12-07 20:08:37,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-12-07 20:08:37,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:08:37,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-12-07 20:08:37,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=5149, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 20:08:37,219 INFO L87 Difference]: Start difference. First operand 232 states and 265 transitions. Second operand 65 states. [2019-12-07 20:08:38,429 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-12-07 20:08:40,683 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-12-07 20:08:41,594 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 98 [2019-12-07 20:08:42,460 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-12-07 20:08:42,639 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-12-07 20:08:42,866 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 88 [2019-12-07 20:08:43,220 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-12-07 20:08:44,407 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-12-07 20:08:44,634 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-12-07 20:08:44,877 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-12-07 20:08:45,316 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 96 [2019-12-07 20:08:45,542 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 87 [2019-12-07 20:08:45,827 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 97 [2019-12-07 20:08:46,920 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-12-07 20:08:47,148 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-12-07 20:08:47,811 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 96 [2019-12-07 20:08:49,084 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-12-07 20:08:49,358 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-12-07 20:08:49,583 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-12-07 20:08:49,837 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-12-07 20:08:50,096 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2019-12-07 20:08:50,364 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2019-12-07 20:08:50,630 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-12-07 20:08:51,511 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-12-07 20:08:51,773 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-12-07 20:08:53,193 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-12-07 20:08:53,546 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 103 [2019-12-07 20:08:53,796 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-12-07 20:08:54,072 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2019-12-07 20:08:54,337 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2019-12-07 20:08:56,496 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-12-07 20:08:56,775 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-12-07 20:08:58,138 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-12-07 20:08:59,135 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-12-07 20:08:59,418 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 98 [2019-12-07 20:08:59,682 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 100 [2019-12-07 20:09:00,010 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2019-12-07 20:09:00,291 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-12-07 20:09:00,620 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-12-07 20:09:01,576 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-12-07 20:09:02,858 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-12-07 20:09:03,224 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2019-12-07 20:09:03,512 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-12-07 20:09:03,799 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2019-12-07 20:09:05,117 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2019-12-07 20:09:06,149 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-12-07 20:09:06,404 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-12-07 20:09:06,740 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-12-07 20:09:07,047 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2019-12-07 20:09:07,355 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-12-07 20:09:08,625 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-12-07 20:09:09,216 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-12-07 20:09:10,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:10,758 INFO L93 Difference]: Finished difference Result 605 states and 664 transitions. [2019-12-07 20:09:10,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-07 20:09:10,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 34 [2019-12-07 20:09:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:10,760 INFO L225 Difference]: With dead ends: 605 [2019-12-07 20:09:10,760 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 20:09:10,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5889 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=2800, Invalid=19550, Unknown=0, NotChecked=0, Total=22350 [2019-12-07 20:09:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 20:09:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 244. [2019-12-07 20:09:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-07 20:09:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 280 transitions. [2019-12-07 20:09:10,765 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 280 transitions. Word has length 34 [2019-12-07 20:09:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:10,765 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 280 transitions. [2019-12-07 20:09:10,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-12-07 20:09:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 280 transitions. [2019-12-07 20:09:10,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:09:10,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:10,765 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:10,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:10,967 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2069618510, now seen corresponding path program 1 times [2019-12-07 20:09:10,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:10,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405126406] [2019-12-07 20:09:10,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:09:11,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405126406] [2019-12-07 20:09:11,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549508124] [2019-12-07 20:09:11,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:11,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 20:09:11,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:09:11,395 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:09:11,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1721184329] [2019-12-07 20:09:11,654 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-12-07 20:09:11,655 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:11,655 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:11,655 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:11,655 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:11,731 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:12,378 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:12,673 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 103 [2019-12-07 20:09:13,254 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-12-07 20:09:13,632 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-12-07 20:09:14,056 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-07 20:09:14,392 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-07 20:09:15,000 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-12-07 20:09:15,630 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 119 [2019-12-07 20:09:16,183 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-12-07 20:09:16,581 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-12-07 20:09:16,845 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-12-07 20:09:17,133 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-12-07 20:09:17,633 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-12-07 20:09:17,946 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-12-07 20:09:18,292 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101 [2019-12-07 20:09:18,292 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:09:18,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:18,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2019-12-07 20:09:18,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421952819] [2019-12-07 20:09:18,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 20:09:18,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 20:09:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2378, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 20:09:18,293 INFO L87 Difference]: Start difference. First operand 244 states and 280 transitions. Second operand 35 states. [2019-12-07 20:09:19,549 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-07 20:09:19,950 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 20:09:20,157 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-07 20:09:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:21,489 INFO L93 Difference]: Finished difference Result 385 states and 425 transitions. [2019-12-07 20:09:21,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 20:09:21,489 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-12-07 20:09:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:21,491 INFO L225 Difference]: With dead ends: 385 [2019-12-07 20:09:21,491 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 20:09:21,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=838, Invalid=5482, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 20:09:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 20:09:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 288. [2019-12-07 20:09:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 20:09:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 329 transitions. [2019-12-07 20:09:21,497 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 329 transitions. Word has length 34 [2019-12-07 20:09:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:21,497 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 329 transitions. [2019-12-07 20:09:21,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 20:09:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 329 transitions. [2019-12-07 20:09:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 20:09:21,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:21,498 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:21,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:21,700 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:21,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:21,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1833251389, now seen corresponding path program 13 times [2019-12-07 20:09:21,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:21,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130847513] [2019-12-07 20:09:21,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:21,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130847513] [2019-12-07 20:09:21,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246917750] [2019-12-07 20:09:21,912 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:21,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 20:09:21,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:22,267 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 49 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:23,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1743699021] [2019-12-07 20:09:23,230 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-12-07 20:09:23,230 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:23,231 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:23,231 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:23,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:23,336 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:23,572 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:23,606 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:23,612 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:09:23,871 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:09:24,159 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 20:09:24,618 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-12-07 20:09:25,263 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2019-12-07 20:09:25,818 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2019-12-07 20:09:26,259 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-12-07 20:09:26,948 WARN L192 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-12-07 20:09:27,209 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2019-12-07 20:09:27,210 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:09:27,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:09:27,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2019-12-07 20:09:27,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349020211] [2019-12-07 20:09:27,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-07 20:09:27,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:27,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-07 20:09:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3610, Unknown=0, NotChecked=0, Total=4032 [2019-12-07 20:09:27,211 INFO L87 Difference]: Start difference. First operand 288 states and 329 transitions. Second operand 55 states. [2019-12-07 20:09:29,606 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-12-07 20:09:30,345 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-12-07 20:09:30,985 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-12-07 20:09:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:34,104 INFO L93 Difference]: Finished difference Result 629 states and 693 transitions. [2019-12-07 20:09:34,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 20:09:34,104 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 36 [2019-12-07 20:09:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:34,106 INFO L225 Difference]: With dead ends: 629 [2019-12-07 20:09:34,106 INFO L226 Difference]: Without dead ends: 615 [2019-12-07 20:09:34,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1090, Invalid=5716, Unknown=0, NotChecked=0, Total=6806 [2019-12-07 20:09:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-12-07 20:09:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 311. [2019-12-07 20:09:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-12-07 20:09:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 354 transitions. [2019-12-07 20:09:34,111 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 354 transitions. Word has length 36 [2019-12-07 20:09:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:34,111 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 354 transitions. [2019-12-07 20:09:34,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-07 20:09:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 354 transitions. [2019-12-07 20:09:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 20:09:34,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:34,112 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:34,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:34,313 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:34,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1875856108, now seen corresponding path program 4 times [2019-12-07 20:09:34,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:09:34,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782844291] [2019-12-07 20:09:34,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:09:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:09:34,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782844291] [2019-12-07 20:09:34,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225055921] [2019-12-07 20:09:34,531 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:09:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:34,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 77 conjunts are in the unsatisfiable core [2019-12-07 20:09:34,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:35,193 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-07 20:09:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:09:35,441 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:36,797 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 20:09:36,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [584681856] [2019-12-07 20:09:36,798 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 20:09:36,798 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:09:36,798 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:09:36,798 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:09:36,798 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:09:36,802 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2b0da9b9 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 20:09:36,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:09:36,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-12-07 20:09:36,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140693011] [2019-12-07 20:09:36,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:09:36,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:09:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:09:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 20:09:36,804 INFO L87 Difference]: Start difference. First operand 311 states and 354 transitions. Second operand 12 states. [2019-12-07 20:09:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:09:37,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:37,005 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@2b0da9b9 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 20:09:37,007 INFO L168 Benchmark]: Toolchain (without parser) took 287183.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -129.9 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:09:37,007 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:09:37,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:09:37,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.73 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 20:09:37,008 INFO L168 Benchmark]: Boogie Preprocessor took 19.30 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 20:09:37,008 INFO L168 Benchmark]: RCFGBuilder took 345.62 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:09:37,008 INFO L168 Benchmark]: TraceAbstraction took 286458.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 37.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -26.4 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:09:37,009 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -148.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.73 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 19.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 345.62 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 286458.11 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 37.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -26.4 MB). Peak memory consumption was 10.8 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@2b0da9b9 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2b0da9b9: 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. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 20:09:38,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:09:38,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:09:38,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:09:38,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:09:38,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:09:38,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:09:38,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:09:38,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:09:38,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:09:38,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:09:38,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:09:38,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:09:38,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:09:38,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:09:38,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:09:38,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:09:38,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:09:38,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:09:38,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:09:38,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:09:38,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:09:38,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:09:38,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:09:38,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:09:38,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:09:38,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:09:38,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:09:38,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:09:38,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:09:38,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:09:38,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:09:38,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:09:38,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:09:38,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:09:38,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:09:38,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:09:38,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:09:38,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:09:38,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:09:38,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:09:38,415 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 20:09:38,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:09:38,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:09:38,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:09:38,426 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:09:38,427 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:09:38,427 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:09:38,427 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:09:38,427 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:09:38,427 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:09:38,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:09:38,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:09:38,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:09:38,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:09:38,428 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:09:38,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:09:38,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:09:38,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:09:38,429 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:09:38,429 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:09:38,429 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:09:38,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:09:38,429 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:09:38,430 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 20:09:38,430 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 20:09:38,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:09:38,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:09:38,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:09:38,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 20:09:38,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:09:38,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:09:38,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:09:38,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:09:38,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:09:38,431 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 20:09:38,431 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 20:09:38,431 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:09:38,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:09:38,432 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_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 -> bea41ba7ef8afa8e6ccd1150cee95a00bf0377da [2019-12-07 20:09:38,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:09:38,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:09:38,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:09:38,610 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:09:38,610 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:09:38,610 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i [2019-12-07 20:09:38,647 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data/999626103/a8344d777d5240c1a37c90104af63ca6/FLAGb57edafc4 [2019-12-07 20:09:39,088 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:09:39,088 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i [2019-12-07 20:09:39,098 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data/999626103/a8344d777d5240c1a37c90104af63ca6/FLAGb57edafc4 [2019-12-07 20:09:39,107 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/data/999626103/a8344d777d5240c1a37c90104af63ca6 [2019-12-07 20:09:39,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:09:39,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:09:39,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:09:39,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:09:39,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:09:39,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359df4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39, skipping insertion in model container [2019-12-07 20:09:39,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:09:39,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:09:39,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:09:39,361 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:09:39,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:09:39,431 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:09:39,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39 WrapperNode [2019-12-07 20:09:39,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:09:39,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:09:39,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:09:39,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:09:39,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:09:39,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:09:39,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:09:39,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:09:39,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... [2019-12-07 20:09:39,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:09:39,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:09:39,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:09:39,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:09:39,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:09:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 20:09:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:09:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 20:09:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:09:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:09:39,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:09:39,827 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:09:39,827 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 20:09:39,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:09:39 BoogieIcfgContainer [2019-12-07 20:09:39,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:09:39,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:09:39,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:09:39,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:09:39,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:09:39" (1/3) ... [2019-12-07 20:09:39,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77770f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:09:39, skipping insertion in model container [2019-12-07 20:09:39,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:09:39" (2/3) ... [2019-12-07 20:09:39,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77770f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:09:39, skipping insertion in model container [2019-12-07 20:09:39,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:09:39" (3/3) ... [2019-12-07 20:09:39,833 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca-2.i [2019-12-07 20:09:39,839 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:09:39,844 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-12-07 20:09:39,851 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-12-07 20:09:39,863 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:09:39,863 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:09:39,863 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:09:39,863 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:09:39,863 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:09:39,863 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:09:39,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:09:39,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:09:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-12-07 20:09:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:09:39,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:39,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:39,878 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1805031113, now seen corresponding path program 1 times [2019-12-07 20:09:39,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:09:39,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601011778] [2019-12-07 20:09:39,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:09:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:39,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:09:39,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:39,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 20:09:39,951 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:39,954 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 20:09:39,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601011778] [2019-12-07 20:09:39,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:39,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:09:39,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932679130] [2019-12-07 20:09:39,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:09:39,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:09:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:09:39,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:09:39,971 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-12-07 20:09:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:40,047 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-12-07 20:09:40,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:09:40,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:09:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:40,055 INFO L225 Difference]: With dead ends: 51 [2019-12-07 20:09:40,055 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 20:09:40,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 20:09:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 20:09:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 20:09:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 20:09:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-12-07 20:09:40,079 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 7 [2019-12-07 20:09:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:40,079 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-12-07 20:09:40,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:09:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-12-07 20:09:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:09:40,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:40,080 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:40,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 20:09:40,281 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 121388915, now seen corresponding path program 1 times [2019-12-07 20:09:40,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:09:40,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606210750] [2019-12-07 20:09:40,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:09:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:40,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:09:40,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:40,427 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 20:09:40,427 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:40,473 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 20:09:40,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606210750] [2019-12-07 20:09:40,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:40,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 20:09:40,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466633297] [2019-12-07 20:09:40,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:09:40,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:09:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:09:40,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:09:40,476 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 8 states. [2019-12-07 20:09:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:40,677 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-12-07 20:09:40,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:09:40,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-12-07 20:09:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:40,678 INFO L225 Difference]: With dead ends: 54 [2019-12-07 20:09:40,678 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 20:09:40,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:09:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 20:09:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 20:09:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 20:09:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-12-07 20:09:40,683 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 8 [2019-12-07 20:09:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:40,683 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-12-07 20:09:40,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:09:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-12-07 20:09:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:09:40,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:40,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:40,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 20:09:40,886 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:40,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash 178647217, now seen corresponding path program 1 times [2019-12-07 20:09:40,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:09:40,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480248049] [2019-12-07 20:09:40,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:09:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:40,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:09:40,972 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:41,018 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:09:41,019 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 19 treesize of output 18 [2019-12-07 20:09:41,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:41,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:41,026 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 20:09:41,026 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 20:09:41,040 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 20:09:41,040 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:41,051 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 20:09:41,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480248049] [2019-12-07 20:09:41,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:41,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 20:09:41,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024326290] [2019-12-07 20:09:41,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:09:41,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:09:41,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:09:41,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:09:41,053 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 4 states. [2019-12-07 20:09:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:41,137 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-12-07 20:09:41,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:09:41,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 20:09:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:41,138 INFO L225 Difference]: With dead ends: 46 [2019-12-07 20:09:41,139 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 20:09:41,139 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 20:09:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 20:09:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 20:09:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 20:09:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-12-07 20:09:41,142 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2019-12-07 20:09:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:41,143 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-12-07 20:09:41,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:09:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-12-07 20:09:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:09:41,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:41,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:41,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 20:09:41,345 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:41,346 INFO L82 PathProgramCache]: Analyzing trace with hash 178647218, now seen corresponding path program 1 times [2019-12-07 20:09:41,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:09:41,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590193628] [2019-12-07 20:09:41,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:09:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:41,415 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:09:41,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:41,428 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_31|]} [2019-12-07 20:09:41,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:41,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:09:41,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:41,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:41,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:09:41,459 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:41,475 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:41,476 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:09:41,476 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-12-07 20:09:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:41,492 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:41,588 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:09:41,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:09:41,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:41,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:41,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:09:41,604 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:41,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:41,611 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:09:41,611 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 20:09:41,627 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 20:09:41,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590193628] [2019-12-07 20:09:41,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:41,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 20:09:41,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69680694] [2019-12-07 20:09:41,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:09:41,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:09:41,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:09:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:09:41,629 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 6 states. [2019-12-07 20:09:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:42,039 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2019-12-07 20:09:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:09:42,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-07 20:09:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:42,042 INFO L225 Difference]: With dead ends: 85 [2019-12-07 20:09:42,042 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 20:09:42,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:09:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 20:09:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2019-12-07 20:09:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 20:09:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-12-07 20:09:42,046 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 8 [2019-12-07 20:09:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:42,047 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-12-07 20:09:42,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:09:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-12-07 20:09:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:09:42,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:42,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:42,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 20:09:42,249 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:42,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:42,250 INFO L82 PathProgramCache]: Analyzing trace with hash -118766615, now seen corresponding path program 1 times [2019-12-07 20:09:42,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:09:42,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441113196] [2019-12-07 20:09:42,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:09:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:42,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:09:42,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:42,343 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:42,431 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 20:09:42,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441113196] [2019-12-07 20:09:42,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:09:42,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-12-07 20:09:42,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039029041] [2019-12-07 20:09:42,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:09:42,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:09:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:09:42,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:09:42,433 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 9 states. [2019-12-07 20:09:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:43,145 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2019-12-07 20:09:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:09:43,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-12-07 20:09:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:43,147 INFO L225 Difference]: With dead ends: 141 [2019-12-07 20:09:43,147 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 20:09:43,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:09:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 20:09:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 48. [2019-12-07 20:09:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 20:09:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-12-07 20:09:43,153 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 10 [2019-12-07 20:09:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:43,153 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-12-07 20:09:43,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:09:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-12-07 20:09:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 20:09:43,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:43,154 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:43,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 20:09:43,356 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1877967093, now seen corresponding path program 1 times [2019-12-07 20:09:43,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:09:43,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118842015] [2019-12-07 20:09:43,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 20:09:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:43,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:09:43,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:43,450 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|v_#valid_34|]} [2019-12-07 20:09:43,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:43,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:09:43,455 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:43,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:43,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:09:43,476 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:43,491 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:43,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:09:43,492 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:09:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:43,611 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:44,085 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:09:44,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:44,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:44,089 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:09:44,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,090 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2019-12-07 20:09:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:44,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118842015] [2019-12-07 20:09:44,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1358146668] [2019-12-07 20:09:44,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:09:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:44,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:09:44,162 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:44,167 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_27|], 1=[|v_#valid_36|]} [2019-12-07 20:09:44,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:44,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 20:09:44,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,191 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:44,198 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:09:44,198 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:44,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,215 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:09:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:44,336 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:44,792 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:09:44,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:44,797 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:44,798 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:09:44,798 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,798 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 20:09:44,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:44,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002335285] [2019-12-07 20:09:44,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:09:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:44,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:09:44,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:44,892 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_29|], 1=[|v_#valid_38|]} [2019-12-07 20:09:44,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:09:44,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:09:44,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:44,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:09:44,911 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:44,921 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:09:44,921 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 20:09:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:45,053 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:09:45,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:09:45,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 4, 5] total 18 [2019-12-07 20:09:45,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128812225] [2019-12-07 20:09:45,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 20:09:45,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:09:45,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 20:09:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:09:45,061 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 19 states. [2019-12-07 20:09:45,595 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 20:09:45,902 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 20:09:46,547 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 20:09:47,121 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-07 20:09:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:09:47,750 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2019-12-07 20:09:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:09:47,752 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 12 [2019-12-07 20:09:47,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:09:47,753 INFO L225 Difference]: With dead ends: 165 [2019-12-07 20:09:47,753 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 20:09:47,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:09:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 20:09:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 60. [2019-12-07 20:09:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-07 20:09:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-12-07 20:09:47,758 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 12 [2019-12-07 20:09:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:09:47,758 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-12-07 20:09:47,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 20:09:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-12-07 20:09:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:09:47,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:09:47,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:09:48,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:09:48,361 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:09:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:09:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash 840060780, now seen corresponding path program 1 times [2019-12-07 20:09:48,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:09:48,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160554335] [2019-12-07 20:09:48,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 20:09:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:48,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:09:48,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:48,611 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 20:09:48,611 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:49,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:49,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-12-07 20:09:49,067 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 20:09:49,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-12-07 20:09:49,088 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 20:09:49,176 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:49,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:09:49,177 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2019-12-07 20:09:49,567 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 20:09:50,168 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 20:09:50,358 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 20:09:50,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160554335] [2019-12-07 20:09:50,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1794587613] [2019-12-07 20:09:50,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:09:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:50,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:09:50,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:51,082 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 20:09:51,082 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:51,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:51,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-12-07 20:09:51,128 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 20:09:51,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-12-07 20:09:51,153 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 20:09:51,278 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-12-07 20:09:51,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:51,279 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:09:51,279 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2019-12-07 20:09:51,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:51,781 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 20:09:51,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727961732] [2019-12-07 20:09:51,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:09:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:09:51,815 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:09:51,815 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:09:51,818 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 20:09:51,818 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:09:51,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:09:51,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-12-07 20:09:51,842 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 20:09:51,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-12-07 20:09:51,862 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 20:09:51,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:09:51,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:09:51,936 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2019-12-07 20:09:52,214 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 20:09:52,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:09:52,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 8, 7] total 20 [2019-12-07 20:09:52,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968389511] [2019-12-07 20:09:52,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 20:09:52,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:09:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 20:09:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:09:52,215 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 21 states. [2019-12-07 20:09:54,443 WARN L192 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-07 20:09:55,701 WARN L192 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-07 20:09:57,151 WARN L192 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-07 20:09:58,374 WARN L192 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-07 20:09:59,475 WARN L192 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-07 20:09:59,825 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 20:10:00,036 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 20:10:03,231 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-07 20:10:03,877 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-07 20:10:05,632 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 20:10:06,001 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-12-07 20:10:09,535 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 20:10:11,489 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-12-07 20:10:17,628 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2019-12-07 20:10:26,557 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-12-07 20:10:38,593 WARN L192 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2019-12-07 20:10:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:39,847 INFO L93 Difference]: Finished difference Result 368 states and 420 transitions. [2019-12-07 20:10:39,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 20:10:39,849 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 14 [2019-12-07 20:10:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:39,851 INFO L225 Difference]: With dead ends: 368 [2019-12-07 20:10:39,852 INFO L226 Difference]: Without dead ends: 368 [2019-12-07 20:10:39,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 41.7s TimeCoverageRelationStatistics Valid=545, Invalid=1525, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 20:10:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-07 20:10:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 92. [2019-12-07 20:10:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 20:10:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-12-07 20:10:39,859 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 14 [2019-12-07 20:10:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:39,859 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-12-07 20:10:39,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 20:10:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-12-07 20:10:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:10:39,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:39,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:40,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:10:40,462 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:40,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:40,463 INFO L82 PathProgramCache]: Analyzing trace with hash 840060832, now seen corresponding path program 1 times [2019-12-07 20:10:40,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:10:40,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112025822] [2019-12-07 20:10:40,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 20:10:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:40,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:10:40,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:40,522 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:40,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112025822] [2019-12-07 20:10:40,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:40,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 20:10:40,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729830170] [2019-12-07 20:10:40,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:40,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:10:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:40,553 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 6 states. [2019-12-07 20:10:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:40,629 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2019-12-07 20:10:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:10:40,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-07 20:10:40,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:40,631 INFO L225 Difference]: With dead ends: 158 [2019-12-07 20:10:40,631 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 20:10:40,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 20:10:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2019-12-07 20:10:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-07 20:10:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2019-12-07 20:10:40,637 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 14 [2019-12-07 20:10:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:40,637 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2019-12-07 20:10:40,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2019-12-07 20:10:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:10:40,638 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:40,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:40,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 20:10:40,839 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1541125410, now seen corresponding path program 1 times [2019-12-07 20:10:40,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:10:40,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37612691] [2019-12-07 20:10:40,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 20:10:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:40,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:10:40,901 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:40,918 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:10:40,918 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 20:10:40,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:10:40,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:40,924 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 20:10:40,924 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 20:10:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:40,931 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:40,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37612691] [2019-12-07 20:10:40,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:40,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:10:40,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687420478] [2019-12-07 20:10:40,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:10:40,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:10:40,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:10:40,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:10:40,935 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand 3 states. [2019-12-07 20:10:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:40,989 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2019-12-07 20:10:40,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:10:40,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 20:10:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:40,990 INFO L225 Difference]: With dead ends: 126 [2019-12-07 20:10:40,990 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 20:10:40,991 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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 20:10:40,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 20:10:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-12-07 20:10:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 20:10:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2019-12-07 20:10:40,995 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 14 [2019-12-07 20:10:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:40,995 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2019-12-07 20:10:40,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:10:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2019-12-07 20:10:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:10:40,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:40,996 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:41,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 20:10:41,198 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1541125411, now seen corresponding path program 1 times [2019-12-07 20:10:41,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:10:41,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700294415] [2019-12-07 20:10:41,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:10:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:41,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:10:41,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:41,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:41,298 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 20:10:41,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:10:41,328 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 20:10:41,328 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:10:41,328 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-12-07 20:10:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:41,353 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:41,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700294415] [2019-12-07 20:10:41,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:41,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 20:10:41,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531606990] [2019-12-07 20:10:41,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:10:41,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:10:41,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:10:41,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:10:41,512 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand 8 states. [2019-12-07 20:10:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:41,890 INFO L93 Difference]: Finished difference Result 162 states and 195 transitions. [2019-12-07 20:10:41,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:10:41,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 20:10:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:41,893 INFO L225 Difference]: With dead ends: 162 [2019-12-07 20:10:41,893 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 20:10:41,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:10:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 20:10:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 130. [2019-12-07 20:10:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 20:10:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 160 transitions. [2019-12-07 20:10:41,896 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 160 transitions. Word has length 14 [2019-12-07 20:10:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:41,896 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 160 transitions. [2019-12-07 20:10:41,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:10:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 160 transitions. [2019-12-07 20:10:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:10:41,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:41,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:42,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 20:10:42,098 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1148098348, now seen corresponding path program 1 times [2019-12-07 20:10:42,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:10:42,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597418378] [2019-12-07 20:10:42,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:10:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:42,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 20:10:42,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:42,791 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 20:10:42,791 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:43,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:43,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-12-07 20:10:43,788 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 20:10:43,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-12-07 20:10:43,805 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 20:10:43,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:43,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:10:43,904 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2019-12-07 20:10:44,416 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-12-07 20:10:44,848 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 20:10:45,234 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2019-12-07 20:10:45,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:45,556 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-12-07 20:10:45,565 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 20:10:45,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597418378] [2019-12-07 20:10:45,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [72354880] [2019-12-07 20:10:45,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:10:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:45,632 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 20:10:45,632 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:46,290 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 20:10:46,290 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:46,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-12-07 20:10:46,840 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 20:10:46,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-12-07 20:10:46,860 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 20:10:46,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:46,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:10:46,943 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:50 [2019-12-07 20:10:47,467 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-12-07 20:10:47,979 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 20:10:48,368 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-12-07 20:10:48,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:48,725 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-12-07 20:10:48,733 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 20:10:48,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9587168] [2019-12-07 20:10:48,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:48,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 20:10:48,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:48,775 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_40|], 1=[|v_#valid_49|]} [2019-12-07 20:10:48,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:10:48,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:10:48,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 20:10:48,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:10:48,917 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-07 20:10:48,917 INFO L614 ElimStorePlain]: treesize reduction 4, result has 91.7 percent of original size [2019-12-07 20:10:48,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:10:48,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 20:10:48,935 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:10:48,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:48,973 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:10:48,974 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:35 [2019-12-07 20:10:49,566 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 20:10:49,566 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:49,893 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 20:10:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:49,899 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:10:49,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:10:49,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:10:50,069 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2019-12-07 20:10:50,069 INFO L614 ElimStorePlain]: treesize reduction 3, result has 95.7 percent of original size [2019-12-07 20:10:50,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:10:50,077 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:10:50,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:50,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 20:10:50,148 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:56 [2019-12-07 20:10:50,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:50,657 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 20:10:50,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:10:50,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8, 8, 7, 7] total 33 [2019-12-07 20:10:50,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78691598] [2019-12-07 20:10:50,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 20:10:50,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:10:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 20:10:50,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 20:10:50,659 INFO L87 Difference]: Start difference. First operand 130 states and 160 transitions. Second operand 34 states. [2019-12-07 20:10:52,273 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 20:10:52,449 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-07 20:10:52,999 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-12-07 20:10:54,138 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-12-07 20:10:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:55,326 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2019-12-07 20:10:55,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:10:55,329 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 14 [2019-12-07 20:10:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:55,330 INFO L225 Difference]: With dead ends: 208 [2019-12-07 20:10:55,330 INFO L226 Difference]: Without dead ends: 208 [2019-12-07 20:10:55,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=483, Invalid=1157, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 20:10:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-12-07 20:10:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 81. [2019-12-07 20:10:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 20:10:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2019-12-07 20:10:55,333 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 14 [2019-12-07 20:10:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:55,334 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2019-12-07 20:10:55,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 20:10:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2019-12-07 20:10:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:10:55,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:55,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:55,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:10:55,937 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash 272080408, now seen corresponding path program 1 times [2019-12-07 20:10:55,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:10:55,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257172344] [2019-12-07 20:10:55,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:10:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:55,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:10:55,984 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:56,001 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:56,001 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 20:10:56,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:10:56,023 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 20:10:56,023 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:10:56,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 20:10:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:56,032 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:56,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257172344] [2019-12-07 20:10:56,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:56,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 20:10:56,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303235761] [2019-12-07 20:10:56,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:56,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:10:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:56,126 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 6 states. [2019-12-07 20:10:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:56,332 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2019-12-07 20:10:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:10:56,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-12-07 20:10:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:56,334 INFO L225 Difference]: With dead ends: 108 [2019-12-07 20:10:56,334 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 20:10:56,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:10:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 20:10:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 80. [2019-12-07 20:10:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 20:10:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2019-12-07 20:10:56,336 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 15 [2019-12-07 20:10:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:56,336 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2019-12-07 20:10:56,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:10:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2019-12-07 20:10:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:10:56,337 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:56,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:56,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 20:10:56,539 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash 944154227, now seen corresponding path program 1 times [2019-12-07 20:10:56,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:10:56,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360710297] [2019-12-07 20:10:56,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 20:10:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:56,630 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:10:56,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:56,643 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:10:56,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360710297] [2019-12-07 20:10:56,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:56,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 20:10:56,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793595853] [2019-12-07 20:10:56,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:10:56,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:10:56,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:10:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:10:56,647 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 5 states. [2019-12-07 20:10:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:56,756 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2019-12-07 20:10:56,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:10:56,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 20:10:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:56,757 INFO L225 Difference]: With dead ends: 79 [2019-12-07 20:10:56,757 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 20:10:56,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:10:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 20:10:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-12-07 20:10:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 20:10:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-12-07 20:10:56,759 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 18 [2019-12-07 20:10:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:56,759 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-12-07 20:10:56,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:10:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-12-07 20:10:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:10:56,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:56,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:56,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 20:10:56,961 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash 944154228, now seen corresponding path program 1 times [2019-12-07 20:10:56,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:10:56,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544094174] [2019-12-07 20:10:56,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 20:10:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:57,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:10:57,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:57,114 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 20:10:57,114 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:57,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:57,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-12-07 20:10:57,265 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 20:10:57,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 20:10:57,274 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 20:10:57,307 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:57,307 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:10:57,308 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:27 [2019-12-07 20:10:57,397 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 20:10:57,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544094174] [2019-12-07 20:10:57,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1478976677] [2019-12-07 20:10:57,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:10:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:57,482 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:10:57,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:57,485 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 20:10:57,485 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:57,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:57,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-12-07 20:10:57,502 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 20:10:57,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 20:10:57,511 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 20:10:57,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:57,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:10:57,544 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-12-07 20:10:57,733 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 20:10:57,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616361117] [2019-12-07 20:10:57,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:57,772 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:10:57,773 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:57,775 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 20:10:57,775 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:57,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:10:57,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2019-12-07 20:10:57,794 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 20:10:57,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-12-07 20:10:57,801 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 20:10:57,838 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:10:57,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 20:10:57,839 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:27 [2019-12-07 20:10:58,017 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 20:10:58,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:10:58,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 9 [2019-12-07 20:10:58,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472268358] [2019-12-07 20:10:58,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:10:58,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:10:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:10:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:10:58,019 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 10 states. [2019-12-07 20:10:58,553 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 20:10:58,816 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2019-12-07 20:10:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:10:59,230 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2019-12-07 20:10:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:10:59,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-07 20:10:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:10:59,232 INFO L225 Difference]: With dead ends: 147 [2019-12-07 20:10:59,232 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 20:10:59,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-12-07 20:10:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 20:10:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 82. [2019-12-07 20:10:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 20:10:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-12-07 20:10:59,234 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 18 [2019-12-07 20:10:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:10:59,235 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-12-07 20:10:59,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:10:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-12-07 20:10:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:10:59,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:10:59,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:10:59,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:10:59,837 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:10:59,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:10:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1095465713, now seen corresponding path program 1 times [2019-12-07 20:10:59,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:10:59,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995433573] [2019-12-07 20:10:59,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 20:10:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:10:59,960 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:10:59,960 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:10:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:59,968 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:10:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:10:59,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995433573] [2019-12-07 20:10:59,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:10:59,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 20:10:59,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796325167] [2019-12-07 20:10:59,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:10:59,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:10:59,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:10:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:10:59,977 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 6 states. [2019-12-07 20:11:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:11:00,019 INFO L93 Difference]: Finished difference Result 176 states and 205 transitions. [2019-12-07 20:11:00,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:11:00,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-07 20:11:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:11:00,020 INFO L225 Difference]: With dead ends: 176 [2019-12-07 20:11:00,020 INFO L226 Difference]: Without dead ends: 176 [2019-12-07 20:11:00,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:11:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-07 20:11:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 82. [2019-12-07 20:11:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 20:11:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2019-12-07 20:11:00,023 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 20 [2019-12-07 20:11:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:11:00,024 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2019-12-07 20:11:00,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:11:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2019-12-07 20:11:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:11:00,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:11:00,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:11:00,225 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 20:11:00,226 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:11:00,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:11:00,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1094114349, now seen corresponding path program 1 times [2019-12-07 20:11:00,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:11:00,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069815762] [2019-12-07 20:11:00,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:11:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:11:00,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 20:11:00,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:00,337 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_48|], 1=[|v_#valid_57|]} [2019-12-07 20:11:00,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:11:00,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:11:00,342 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:00,358 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:00,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:11:00,363 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:00,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:00,379 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:00,379 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:11:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:00,517 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:00,881 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:11:00,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:11:00,884 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:00,885 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:00,885 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:11:00,886 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:00,886 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:1 [2019-12-07 20:11:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:00,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069815762] [2019-12-07 20:11:00,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [346092710] [2019-12-07 20:11:00,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:11:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:11:00,997 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 20:11:00,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:01,001 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_50|], 1=[|v_#valid_59|]} [2019-12-07 20:11:01,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:11:01,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:11:01,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:01,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:01,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:11:01,020 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:01,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:01,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:01,031 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 20:11:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:01,442 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:01,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237273171] [2019-12-07 20:11:01,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:11:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:11:01,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 20:11:01,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:01,979 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_52|], 1=[|v_#valid_61|]} [2019-12-07 20:11:01,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:11:01,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:11:01,982 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:01,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:01,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:11:01,998 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:02,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:02,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:02,009 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 20:11:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:02,011 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:11:02,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:11:02,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8, 8, 8, 8] total 22 [2019-12-07 20:11:02,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594900189] [2019-12-07 20:11:02,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 20:11:02,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:11:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 20:11:02,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2019-12-07 20:11:02,020 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 23 states. [2019-12-07 20:11:03,399 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-12-07 20:11:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:11:04,162 INFO L93 Difference]: Finished difference Result 177 states and 205 transitions. [2019-12-07 20:11:04,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:11:04,163 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2019-12-07 20:11:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:11:04,164 INFO L225 Difference]: With dead ends: 177 [2019-12-07 20:11:04,164 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 20:11:04,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 20:11:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 20:11:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 90. [2019-12-07 20:11:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 20:11:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2019-12-07 20:11:04,167 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 20 [2019-12-07 20:11:04,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:11:04,167 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2019-12-07 20:11:04,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 20:11:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2019-12-07 20:11:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:11:04,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:11:04,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:11:04,769 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 20:11:04,770 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:11:04,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:11:04,771 INFO L82 PathProgramCache]: Analyzing trace with hash -442195040, now seen corresponding path program 1 times [2019-12-07 20:11:04,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:11:04,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069490051] [2019-12-07 20:11:04,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/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 20:11:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:11:04,853 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:11:04,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:04,863 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:11:04,864 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 20:11:04,864 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:04,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:04,868 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 20:11:04,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 20:11:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:04,886 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:04,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069490051] [2019-12-07 20:11:04,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:11:04,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 20:11:04,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641658044] [2019-12-07 20:11:04,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:11:04,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:11:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:11:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:11:04,891 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand 6 states. [2019-12-07 20:11:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:11:05,013 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-12-07 20:11:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:11:05,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 20:11:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:11:05,014 INFO L225 Difference]: With dead ends: 89 [2019-12-07 20:11:05,014 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 20:11:05,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 1 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 20:11:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 20:11:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-12-07 20:11:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 20:11:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2019-12-07 20:11:05,015 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 21 [2019-12-07 20:11:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:11:05,016 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2019-12-07 20:11:05,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:11:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2019-12-07 20:11:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:11:05,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:11:05,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:11:05,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 20:11:05,217 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:11:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:11:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash -442195039, now seen corresponding path program 1 times [2019-12-07 20:11:05,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:11:05,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092642982] [2019-12-07 20:11:05,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 20:11:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:11:05,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:11:05,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:05,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:05,321 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 20:11:05,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:05,338 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 20:11:05,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:05,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 20:11:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:05,372 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:05,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092642982] [2019-12-07 20:11:05,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:11:05,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 20:11:05,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141716248] [2019-12-07 20:11:05,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:11:05,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:11:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:11:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:11:05,573 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 12 states. [2019-12-07 20:11:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:11:06,584 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2019-12-07 20:11:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:11:06,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-07 20:11:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:11:06,586 INFO L225 Difference]: With dead ends: 132 [2019-12-07 20:11:06,586 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 20:11:06,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:11:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 20:11:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 91. [2019-12-07 20:11:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 20:11:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2019-12-07 20:11:06,588 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 21 [2019-12-07 20:11:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:11:06,588 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2019-12-07 20:11:06,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:11:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2019-12-07 20:11:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:11:06,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:11:06,588 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:11:06,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 20:11:06,790 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:11:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:11:06,790 INFO L82 PathProgramCache]: Analyzing trace with hash -823097434, now seen corresponding path program 2 times [2019-12-07 20:11:06,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:11:06,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449047309] [2019-12-07 20:11:06,792 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 20:11:06,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:11:06,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:11:06,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 20:11:06,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:06,961 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_66|]} [2019-12-07 20:11:06,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:11:06,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:11:06,966 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:06,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:06,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:11:06,987 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:07,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:07,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:07,002 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:25 [2019-12-07 20:11:07,028 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 17 treesize of output 13 [2019-12-07 20:11:07,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:07,047 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:07,048 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:07,048 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 20:11:07,086 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 31 treesize of output 30 [2019-12-07 20:11:07,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:07,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:07,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:11:07,119 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-12-07 20:11:07,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:07,307 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2019-12-07 20:11:07,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:11:07,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:11:07,308 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 20:11:07,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:07,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:11:07,327 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 20:11:07,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:27 [2019-12-07 20:11:07,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:11:07,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:11:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:07,580 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:08,669 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 18 treesize of output 16 [2019-12-07 20:11:08,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 20:11:08,697 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-07 20:11:08,703 INFO L614 ElimStorePlain]: treesize reduction 7, result has 53.3 percent of original size [2019-12-07 20:11:08,703 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:08,713 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 18 treesize of output 16 [2019-12-07 20:11:08,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-12-07 20:11:08,734 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-12-07 20:11:08,740 INFO L614 ElimStorePlain]: treesize reduction 7, result has 53.3 percent of original size [2019-12-07 20:11:08,740 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:08,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:08,780 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 20:11:08,781 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:69, output treesize:49 [2019-12-07 20:11:08,987 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:11:08,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:11:08,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:09,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:09,012 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:11:09,012 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:09,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:09,028 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:09,029 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:15 [2019-12-07 20:11:09,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:09,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449047309] [2019-12-07 20:11:09,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1508933396] [2019-12-07 20:11:09,144 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:11:09,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:11:09,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:11:09,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 20:11:09,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:09,492 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_59|], 1=[|v_#valid_68|]} [2019-12-07 20:11:09,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:11:09,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:11:09,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 20:11:09,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:09,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:09,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:11:09,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 20:11:09,539 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:09,569 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:09,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:09,569 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2019-12-07 20:11:10,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:10,179 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 62 treesize of output 54 [2019-12-07 20:11:10,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:11:10,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:11:10,181 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 20:11:10,248 INFO L614 ElimStorePlain]: treesize reduction 19, result has 66.7 percent of original size [2019-12-07 20:11:10,254 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 15 treesize of output 11 [2019-12-07 20:11:10,254 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:10,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:10,282 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 20:11:10,282 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:34 [2019-12-07 20:11:10,437 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 24 treesize of output 23 [2019-12-07 20:11:10,437 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:10,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:10,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 20:11:10,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2019-12-07 20:11:10,988 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:11:10,989 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2019-12-07 20:11:10,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:11,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:11,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:11,009 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:5 [2019-12-07 20:11:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:11,098 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:11,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-12-07 20:11:11,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2019-12-07 20:11:11,695 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:11,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:11,697 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:11,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:11,745 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:11,745 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:32 [2019-12-07 20:11:13,320 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:11:13,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:11:13,332 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:13,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:13,388 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:11:13,389 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:13,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:13,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:13,433 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:43 [2019-12-07 20:11:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:13,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431666816] [2019-12-07 20:11:13,780 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:11:13,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:11:13,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:11:13,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 20:11:13,826 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:11:13,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:11:13,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:13,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:13,844 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:13,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 20:11:14,492 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 15 treesize of output 11 [2019-12-07 20:11:14,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:14,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:14,511 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 20:11:14,511 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-12-07 20:11:14,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-12-07 20:11:14,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:14,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:14,727 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 20:11:14,727 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:41 [2019-12-07 20:11:21,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:11:21,457 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-12-07 20:11:21,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:21,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:21,470 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:21,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:5 [2019-12-07 20:11:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:21,473 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:11:21,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-12-07 20:11:21,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2019-12-07 20:11:21,735 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:11:21,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:21,737 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:21,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:11:21,740 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:11:21,740 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-12-07 20:11:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:11:22,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:11:22,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13, 11, 13, 11] total 52 [2019-12-07 20:11:22,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845697989] [2019-12-07 20:11:22,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-07 20:11:22,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:11:22,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-07 20:11:22,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2394, Unknown=3, NotChecked=0, Total=2652 [2019-12-07 20:11:22,752 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 52 states. [2019-12-07 20:11:23,194 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-12-07 20:11:23,480 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-12-07 20:11:24,254 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 20:11:25,053 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-07 20:11:25,753 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 20:11:26,463 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-07 20:11:27,197 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-12-07 20:11:27,935 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-07 20:11:28,243 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-12-07 20:11:28,818 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-12-07 20:11:29,498 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-07 20:11:30,214 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-12-07 20:11:30,890 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-07 20:11:31,703 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-12-07 20:11:33,810 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 20:11:34,165 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-07 20:11:38,739 WARN L192 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-12-07 20:11:39,099 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-07 20:11:39,405 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 20:11:39,703 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 20:11:44,136 WARN L192 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-07 20:11:44,510 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-12-07 20:11:53,832 WARN L192 SmtUtils]: Spent 8.81 s on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-12-07 20:12:02,374 WARN L192 SmtUtils]: Spent 5.96 s on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-12-07 20:12:12,264 WARN L192 SmtUtils]: Spent 9.36 s on a formula simplification. DAG size of input: 118 DAG size of output: 85 [2019-12-07 20:12:26,007 WARN L192 SmtUtils]: Spent 11.16 s on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-12-07 20:12:26,656 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-07 20:12:36,210 WARN L192 SmtUtils]: Spent 9.28 s on a formula simplification. DAG size of input: 132 DAG size of output: 88 [2019-12-07 20:12:36,655 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-07 20:12:47,124 WARN L192 SmtUtils]: Spent 9.81 s on a formula simplification. DAG size of input: 123 DAG size of output: 83 [2019-12-07 20:12:47,873 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 20:13:05,502 WARN L192 SmtUtils]: Spent 4.70 s on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-12-07 20:13:06,266 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-07 20:13:17,390 WARN L192 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-12-07 20:13:28,570 WARN L192 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2019-12-07 20:13:31,668 WARN L192 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-07 20:13:36,906 WARN L192 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 20:13:48,536 WARN L192 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-12-07 20:13:51,587 WARN L192 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-12-07 20:13:54,315 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-12-07 20:13:54,866 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-12-07 20:13:58,612 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-12-07 20:14:00,277 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-07 20:14:06,816 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-12-07 20:14:10,967 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-12-07 20:14:11,734 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 20:14:12,690 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-12-07 20:14:13,018 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-07 20:14:13,703 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-07 20:14:14,536 WARN L192 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-12-07 20:14:15,912 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-12-07 20:14:16,683 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-12-07 20:14:17,567 WARN L192 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-12-07 20:14:18,219 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-12-07 20:14:24,270 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-12-07 20:14:25,131 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-12-07 20:14:25,438 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 20:14:25,948 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-07 20:14:26,523 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-07 20:14:27,168 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 20:14:27,750 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-07 20:14:28,216 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 20:14:29,020 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 20:14:29,412 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-07 20:14:30,049 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-12-07 20:14:30,513 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-12-07 20:14:31,040 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-07 20:14:31,585 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-12-07 20:14:31,985 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-12-07 20:14:32,562 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-07 20:14:33,083 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-07 20:14:33,568 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-12-07 20:14:34,098 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-12-07 20:14:34,614 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-12-07 20:14:35,060 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 20:14:35,700 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-07 20:14:36,301 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-07 20:14:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:36,632 INFO L93 Difference]: Finished difference Result 512 states and 585 transitions. [2019-12-07 20:14:36,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-12-07 20:14:36,633 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 22 [2019-12-07 20:14:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:36,635 INFO L225 Difference]: With dead ends: 512 [2019-12-07 20:14:36,635 INFO L226 Difference]: Without dead ends: 512 [2019-12-07 20:14:36,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8871 ImplicationChecksByTransitivity, 179.4s TimeCoverageRelationStatistics Valid=4023, Invalid=22688, Unknown=21, NotChecked=0, Total=26732 [2019-12-07 20:14:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-07 20:14:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 154. [2019-12-07 20:14:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 20:14:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 189 transitions. [2019-12-07 20:14:36,645 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 189 transitions. Word has length 22 [2019-12-07 20:14:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:36,646 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 189 transitions. [2019-12-07 20:14:36,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-07 20:14:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 189 transitions. [2019-12-07 20:14:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:14:36,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:36,646 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:37,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 mathsat -unsat_core_generation=3,31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:14:37,249 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:14:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:37,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1863163671, now seen corresponding path program 1 times [2019-12-07 20:14:37,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:14:37,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059689310] [2019-12-07 20:14:37,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 20:14:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:37,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:14:37,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:37,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:37,321 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 20:14:37,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:37,355 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 20:14:37,355 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:37,355 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 20:14:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:14:37,459 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:37,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:14:37,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059689310] [2019-12-07 20:14:37,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1587678754] [2019-12-07 20:14:37,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:14:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:37,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 20:14:37,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:38,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:14:38,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:38,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 20:14:38,067 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:38,120 INFO L614 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-12-07 20:14:38,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:38,121 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2019-12-07 20:14:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:38,907 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:40,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285687078] [2019-12-07 20:14:40,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:14:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:14:40,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:14:40,897 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:40,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:40,913 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 20:14:40,913 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:40,946 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 20:14:40,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:40,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 20:14:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:14:41,115 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:14:41,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:14:41,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 12, 11, 6, 6] total 33 [2019-12-07 20:14:41,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859155118] [2019-12-07 20:14:41,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 20:14:41,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:14:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 20:14:41,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 20:14:41,696 INFO L87 Difference]: Start difference. First operand 154 states and 189 transitions. Second operand 33 states. [2019-12-07 20:14:45,357 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-12-07 20:14:46,240 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 19 [2019-12-07 20:14:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:14:47,257 INFO L93 Difference]: Finished difference Result 470 states and 560 transitions. [2019-12-07 20:14:47,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 20:14:47,259 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 22 [2019-12-07 20:14:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:14:47,260 INFO L225 Difference]: With dead ends: 470 [2019-12-07 20:14:47,260 INFO L226 Difference]: Without dead ends: 470 [2019-12-07 20:14:47,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=928, Invalid=2494, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 20:14:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-12-07 20:14:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 154. [2019-12-07 20:14:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 20:14:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 187 transitions. [2019-12-07 20:14:47,266 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 187 transitions. Word has length 22 [2019-12-07 20:14:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:14:47,266 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 187 transitions. [2019-12-07 20:14:47,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 20:14:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 187 transitions. [2019-12-07 20:14:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:14:47,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:14:47,267 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:14:47,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 cvc4 --incremental --print-success --lang smt --rewrite-divk,33 mathsat -unsat_core_generation=3 [2019-12-07 20:14:47,869 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:14:47,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:14:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash 838867134, now seen corresponding path program 2 times [2019-12-07 20:14:47,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:14:47,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119990500] [2019-12-07 20:14:47,871 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 20:14:47,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:14:47,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:14:47,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:14:47,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:47,935 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_68|], 1=[|v_#valid_75|]} [2019-12-07 20:14:47,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:14:47,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:14:47,941 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:47,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:47,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:14:47,964 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:47,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:47,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:47,983 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:14:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:48,184 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:49,308 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:14:49,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:14:49,314 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:49,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:49,315 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:14:49,315 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:49,315 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 20:14:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:49,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119990500] [2019-12-07 20:14:49,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [925555308] [2019-12-07 20:14:49,318 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:14:49,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:14:49,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:14:49,417 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 20:14:49,418 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:49,420 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_70|], 1=[|v_#valid_77|]} [2019-12-07 20:14:49,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:14:49,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:14:49,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:49,444 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:49,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:14:49,450 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:49,467 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:49,468 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:49,468 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:14:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:49,906 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:51,956 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:14:51,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:14:51,961 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:51,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:51,962 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:14:51,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:51,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:1 [2019-12-07 20:14:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:51,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910542914] [2019-12-07 20:14:51,965 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:14:52,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 20:14:52,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:14:52,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:14:52,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:14:52,008 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_72|], 1=[|v_#valid_79|]} [2019-12-07 20:14:52,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:14:52,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:14:52,015 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:52,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:52,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:14:52,038 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:52,054 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:52,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:52,055 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:14:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:52,134 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:14:52,139 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:14:52,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:14:52,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:14:52,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:14:52,144 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:14:52,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:14:52,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 20:14:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:14:52,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:14:52,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 9, 8, 8] total 29 [2019-12-07 20:14:52,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434619998] [2019-12-07 20:14:52,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 20:14:52,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:14:52,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 20:14:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-12-07 20:14:52,148 INFO L87 Difference]: Start difference. First operand 154 states and 187 transitions. Second operand 30 states. [2019-12-07 20:14:55,417 WARN L192 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-07 20:14:56,874 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 20:15:00,526 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 20:15:01,909 WARN L192 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-12-07 20:15:03,687 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-07 20:15:06,739 WARN L192 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-07 20:15:07,621 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-07 20:15:08,812 WARN L192 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-07 20:15:11,586 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 20:15:12,220 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 20:15:13,137 WARN L192 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-07 20:15:14,717 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 20:15:15,832 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-07 20:15:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:17,193 INFO L93 Difference]: Finished difference Result 733 states and 873 transitions. [2019-12-07 20:15:17,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 20:15:17,195 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 24 [2019-12-07 20:15:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:17,198 INFO L225 Difference]: With dead ends: 733 [2019-12-07 20:15:17,198 INFO L226 Difference]: Without dead ends: 733 [2019-12-07 20:15:17,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=665, Invalid=1785, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 20:15:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-12-07 20:15:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 250. [2019-12-07 20:15:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 20:15:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 307 transitions. [2019-12-07 20:15:17,204 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 307 transitions. Word has length 24 [2019-12-07 20:15:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:17,205 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 307 transitions. [2019-12-07 20:15:17,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 20:15:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 307 transitions. [2019-12-07 20:15:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 20:15:17,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:17,205 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 20:15:17,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 cvc4 --incremental --print-success --lang smt --rewrite-divk,36 mathsat -unsat_core_generation=3 [2019-12-07 20:15:17,807 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:15:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1112122393, now seen corresponding path program 1 times [2019-12-07 20:15:17,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:15:17,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045413573] [2019-12-07 20:15:17,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 20:15:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:17,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 20:15:17,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:15:17,889 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_74|], 1=[|v_#valid_81|]} [2019-12-07 20:15:17,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:15:17,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:15:17,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:17,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:17,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:15:17,917 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:17,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:17,936 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:15:17,936 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:15:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:18,239 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:15:19,509 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:15:19,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:15:19,513 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:19,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:19,514 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:15:19,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:15:19,514 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 20:15:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:19,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045413573] [2019-12-07 20:15:19,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2108497680] [2019-12-07 20:15:19,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:15:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:19,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 20:15:19,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:15:19,671 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_76|], 1=[|v_#valid_83|]} [2019-12-07 20:15:19,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:15:19,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:15:19,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:19,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:19,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:15:19,696 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:19,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:19,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:15:19,709 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 20:15:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:20,670 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:15:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:22,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347881259] [2019-12-07 20:15:22,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:15:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:22,563 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 20:15:22,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:15:22,565 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_78|], 1=[|v_#valid_85|]} [2019-12-07 20:15:22,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:15:22,568 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2019-12-07 20:15:22,569 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:22,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:22,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 20:15:22,583 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:22,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:22,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:15:22,593 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 20:15:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:22,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:15:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:23,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:15:23,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11, 12, 11, 11] total 37 [2019-12-07 20:15:23,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564708307] [2019-12-07 20:15:23,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 20:15:23,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:15:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 20:15:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 20:15:23,539 INFO L87 Difference]: Start difference. First operand 250 states and 307 transitions. Second operand 38 states. [2019-12-07 20:15:26,736 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-12-07 20:15:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:27,887 INFO L93 Difference]: Finished difference Result 438 states and 524 transitions. [2019-12-07 20:15:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:15:27,889 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 26 [2019-12-07 20:15:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:27,891 INFO L225 Difference]: With dead ends: 438 [2019-12-07 20:15:27,891 INFO L226 Difference]: Without dead ends: 438 [2019-12-07 20:15:27,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=617, Invalid=2353, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 20:15:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-07 20:15:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 260. [2019-12-07 20:15:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 20:15:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 321 transitions. [2019-12-07 20:15:27,896 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 321 transitions. Word has length 26 [2019-12-07 20:15:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:27,896 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 321 transitions. [2019-12-07 20:15:27,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 20:15:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 321 transitions. [2019-12-07 20:15:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:15:27,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:27,897 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:15:28,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:15:28,499 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:15:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash 803583084, now seen corresponding path program 1 times [2019-12-07 20:15:28,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:15:28,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142156389] [2019-12-07 20:15:28,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 42 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with mathsat -unsat_core_generation=3 [2019-12-07 20:15:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:28,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:15:28,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:15:28,585 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 20:15:28,585 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:28,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:28,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:15:28,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 20:15:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:15:30,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:15:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:15:33,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142156389] [2019-12-07 20:15:33,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:33,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 20:15:33,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462164396] [2019-12-07 20:15:33,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:15:33,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:15:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:15:33,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=46, Unknown=2, NotChecked=0, Total=72 [2019-12-07 20:15:33,083 INFO L87 Difference]: Start difference. First operand 260 states and 321 transitions. Second operand 9 states. [2019-12-07 20:15:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:45,228 INFO L93 Difference]: Finished difference Result 259 states and 320 transitions. [2019-12-07 20:15:45,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:15:45,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-12-07 20:15:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:45,229 INFO L225 Difference]: With dead ends: 259 [2019-12-07 20:15:45,230 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 20:15:45,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=29, Invalid=59, Unknown=2, NotChecked=0, Total=90 [2019-12-07 20:15:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 20:15:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-12-07 20:15:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-12-07 20:15:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 311 transitions. [2019-12-07 20:15:45,233 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 311 transitions. Word has length 27 [2019-12-07 20:15:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:45,233 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 311 transitions. [2019-12-07 20:15:45,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:15:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 311 transitions. [2019-12-07 20:15:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:15:45,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:45,233 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:15:45,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 mathsat -unsat_core_generation=3 [2019-12-07 20:15:45,434 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:15:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 805151438, now seen corresponding path program 1 times [2019-12-07 20:15:45,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:15:45,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698060054] [2019-12-07 20:15:45,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 43 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with mathsat -unsat_core_generation=3 [2019-12-07 20:15:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:45,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:15:45,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:15:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:15:45,502 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:15:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:15:45,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698060054] [2019-12-07 20:15:45,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:45,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 20:15:45,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663576358] [2019-12-07 20:15:45,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:15:45,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:15:45,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:15:45,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:15:45,505 INFO L87 Difference]: Start difference. First operand 255 states and 311 transitions. Second operand 5 states. [2019-12-07 20:15:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:45,556 INFO L93 Difference]: Finished difference Result 290 states and 344 transitions. [2019-12-07 20:15:45,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:15:45,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 20:15:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:45,558 INFO L225 Difference]: With dead ends: 290 [2019-12-07 20:15:45,558 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 20:15:45,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:15:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 20:15:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2019-12-07 20:15:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 20:15:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 320 transitions. [2019-12-07 20:15:45,562 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 320 transitions. Word has length 27 [2019-12-07 20:15:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:45,562 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 320 transitions. [2019-12-07 20:15:45,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:15:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 320 transitions. [2019-12-07 20:15:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:15:45,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:45,563 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:15:45,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 mathsat -unsat_core_generation=3 [2019-12-07 20:15:45,764 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:15:45,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:45,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1000286896, now seen corresponding path program 1 times [2019-12-07 20:15:45,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:15:45,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334605742] [2019-12-07 20:15:45,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/mathsat Starting monitored process 44 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with mathsat -unsat_core_generation=3 [2019-12-07 20:15:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:45,883 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 20:15:45,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:15:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:46,234 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:15:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:46,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334605742] [2019-12-07 20:15:46,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [160529158] [2019-12-07 20:15:46,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:15:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:46,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 20:15:46,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:15:46,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-12-07 20:15:46,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:46,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:46,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:15:46,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 20:15:47,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 20:15:47,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:15:47,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:15:47,263 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 20:15:47,263 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-12-07 20:15:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:15:47,312 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:15:47,832 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 20:15:47,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014127756] [2019-12-07 20:15:47,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fb9e64a-1fd9-4357-88a1-b59c2c00b9bb/bin/utaipan/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:15:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:47,875 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 20:15:47,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:15:47,877 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58c53ede [2019-12-07 20:15:47,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:15:47,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-12-07 20:15:47,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85822419] [2019-12-07 20:15:47,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 20:15:47,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:15:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 20:15:47,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2019-12-07 20:15:47,878 INFO L87 Difference]: Start difference. First operand 266 states and 320 transitions. Second operand 18 states. [2019-12-07 20:15:47,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:15:48,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 mathsat -unsat_core_generation=3,45 cvc4 --incremental --print-success --lang smt --rewrite-divk,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:15:48,481 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@58c53ede 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 20:15:48,490 INFO L168 Benchmark]: Toolchain (without parser) took 369379.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.8 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -98.7 MB). Peak memory consumption was 80.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:48,490 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:15:48,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:48,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:48,491 INFO L168 Benchmark]: Boogie Preprocessor took 22.18 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 20:15:48,491 INFO L168 Benchmark]: RCFGBuilder took 341.41 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: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:48,491 INFO L168 Benchmark]: TraceAbstraction took 368659.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.6 MB). Peak memory consumption was 74.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:48,493 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.18 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 341.41 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: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 368659.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 45.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.6 MB). Peak memory consumption was 74.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@58c53ede de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@58c53ede: 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...