./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-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_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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 f3eebd0d696af164582cbeee8be4a910d35e299c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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 f3eebd0d696af164582cbeee8be4a910d35e299c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:31:19,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:31:19,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:31:19,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:31:19,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:31:19,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:31:19,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:31:19,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:31:19,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:31:19,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:31:19,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:31:19,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:31:19,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:31:19,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:31:19,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:31:19,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:31:19,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:31:19,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:31:19,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:31:19,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:31:19,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:31:19,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:31:19,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:31:19,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:31:19,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:31:19,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:31:19,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:31:19,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:31:19,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:31:19,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:31:19,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:31:19,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:31:19,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:31:19,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:31:19,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:31:19,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:31:19,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:31:19,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:31:19,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:31:19,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:31:19,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:31:19,246 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 20:31:19,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:31:19,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:31:19,257 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:31:19,257 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:31:19,257 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:31:19,257 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:31:19,257 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:31:19,257 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:31:19,257 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:31:19,257 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:31:19,257 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:31:19,258 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:31:19,258 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:31:19,258 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:31:19,258 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:31:19,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:31:19,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:31:19,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:31:19,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:31:19,260 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:31:19,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:31:19,260 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:31:19,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:31:19,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:31:19,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:31:19,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:31:19,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:31:19,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:31:19,261 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:31:19,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:31:19,261 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:31:19,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:31:19,261 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_e33449de-6384-406f-8c65-3508595fdbd2/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 -> f3eebd0d696af164582cbeee8be4a910d35e299c [2019-12-07 20:31:19,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:31:19,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:31:19,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:31:19,371 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:31:19,372 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:31:19,372 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2019-12-07 20:31:19,415 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data/97aa23ea9/53012e94958648558c3520f52e632211/FLAG15b270b07 [2019-12-07 20:31:19,779 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:31:19,779 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2019-12-07 20:31:19,789 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data/97aa23ea9/53012e94958648558c3520f52e632211/FLAG15b270b07 [2019-12-07 20:31:19,798 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data/97aa23ea9/53012e94958648558c3520f52e632211 [2019-12-07 20:31:19,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:31:19,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:31:19,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:31:19,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:31:19,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:31:19,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:31:19" (1/1) ... [2019-12-07 20:31:19,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a25c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:19, skipping insertion in model container [2019-12-07 20:31:19,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:31:19" (1/1) ... [2019-12-07 20:31:19,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:31:19,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:31:20,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:31:20,061 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:31:20,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:31:20,117 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:31:20,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20 WrapperNode [2019-12-07 20:31:20,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:31:20,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:31:20,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:31:20,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:31:20,123 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:31:20" (1/1) ... [2019-12-07 20:31:20,133 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:31:20" (1/1) ... [2019-12-07 20:31:20,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:31:20,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:31:20,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:31:20,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:31:20,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (1/1) ... [2019-12-07 20:31:20,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (1/1) ... [2019-12-07 20:31:20,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (1/1) ... [2019-12-07 20:31:20,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (1/1) ... [2019-12-07 20:31:20,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (1/1) ... [2019-12-07 20:31:20,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (1/1) ... [2019-12-07 20:31:20,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (1/1) ... [2019-12-07 20:31:20,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:31:20,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:31:20,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:31:20,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:31:20,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 20:31:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:31:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:31:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:31:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:31:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:31:20,500 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:31:20,501 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 20:31:20,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:31:20 BoogieIcfgContainer [2019-12-07 20:31:20,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:31:20,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:31:20,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:31:20,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:31:20,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:31:19" (1/3) ... [2019-12-07 20:31:20,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dc90b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:31:20, skipping insertion in model container [2019-12-07 20:31:20,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:20" (2/3) ... [2019-12-07 20:31:20,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dc90b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:31:20, skipping insertion in model container [2019-12-07 20:31:20,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:31:20" (3/3) ... [2019-12-07 20:31:20,507 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-2.i [2019-12-07 20:31:20,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:31:20,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 20:31:20,525 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 20:31:20,538 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:31:20,538 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:31:20,538 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:31:20,538 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:31:20,538 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:31:20,538 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:31:20,538 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:31:20,538 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:31:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-12-07 20:31:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:31:20,553 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:20,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:31:20,554 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:20,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:20,557 INFO L82 PathProgramCache]: Analyzing trace with hash 154498, now seen corresponding path program 1 times [2019-12-07 20:31:20,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:20,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340179556] [2019-12-07 20:31:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:20,677 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:31:20,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340179556] [2019-12-07 20:31:20,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:20,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:31:20,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529230816] [2019-12-07 20:31:20,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:31:20,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:31:20,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:31:20,692 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2019-12-07 20:31:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:20,732 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-12-07 20:31:20,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:31:20,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 20:31:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:20,740 INFO L225 Difference]: With dead ends: 37 [2019-12-07 20:31:20,740 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 20:31:20,741 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:31:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 20:31:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 20:31:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 20:31:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-12-07 20:31:20,764 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 3 [2019-12-07 20:31:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:20,765 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-12-07 20:31:20,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:31:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-12-07 20:31:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 20:31:20,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:20,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 20:31:20,765 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:20,766 INFO L82 PathProgramCache]: Analyzing trace with hash 154499, now seen corresponding path program 1 times [2019-12-07 20:31:20,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:20,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536026221] [2019-12-07 20:31:20,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:20,815 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:31:20,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536026221] [2019-12-07 20:31:20,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:20,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:31:20,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075439780] [2019-12-07 20:31:20,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:20,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:20,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:20,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:20,817 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 4 states. [2019-12-07 20:31:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:20,902 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2019-12-07 20:31:20,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:20,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 20:31:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:20,904 INFO L225 Difference]: With dead ends: 70 [2019-12-07 20:31:20,904 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 20:31:20,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:31:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 20:31:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-12-07 20:31:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 20:31:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-12-07 20:31:20,909 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 3 [2019-12-07 20:31:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:20,909 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-12-07 20:31:20,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-12-07 20:31:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:31:20,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:20,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:31:20,910 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash 4886077, now seen corresponding path program 1 times [2019-12-07 20:31:20,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:20,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688906664] [2019-12-07 20:31:20,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:20,930 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:31:20,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688906664] [2019-12-07 20:31:20,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:20,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:31:20,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495389545] [2019-12-07 20:31:20,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:31:20,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:20,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:31:20,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:31:20,932 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 3 states. [2019-12-07 20:31:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:20,954 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-12-07 20:31:20,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:31:20,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 20:31:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:20,955 INFO L225 Difference]: With dead ends: 36 [2019-12-07 20:31:20,955 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 20:31:20,955 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:31:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 20:31:20,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 20:31:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 20:31:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-12-07 20:31:20,958 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 4 [2019-12-07 20:31:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:20,958 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-12-07 20:31:20,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:31:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-12-07 20:31:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:31:20,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:20,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:31:20,959 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:20,959 INFO L82 PathProgramCache]: Analyzing trace with hash 4886078, now seen corresponding path program 1 times [2019-12-07 20:31:20,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:20,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961578223] [2019-12-07 20:31:20,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:20,995 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:31:20,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961578223] [2019-12-07 20:31:20,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:20,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:31:20,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409349358] [2019-12-07 20:31:20,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:31:20,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:31:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:31:20,997 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 5 states. [2019-12-07 20:31:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:21,060 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-12-07 20:31:21,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:31:21,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 20:31:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:21,061 INFO L225 Difference]: With dead ends: 65 [2019-12-07 20:31:21,061 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 20:31:21,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:31:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 20:31:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-12-07 20:31:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 20:31:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-12-07 20:31:21,066 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 4 [2019-12-07 20:31:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:21,066 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-12-07 20:31:21,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:31:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-12-07 20:31:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 20:31:21,067 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:21,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 20:31:21,067 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:21,067 INFO L82 PathProgramCache]: Analyzing trace with hash 4888660, now seen corresponding path program 1 times [2019-12-07 20:31:21,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:21,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490961647] [2019-12-07 20:31:21,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:21,095 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:31:21,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490961647] [2019-12-07 20:31:21,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:21,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:31:21,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964600801] [2019-12-07 20:31:21,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:31:21,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:31:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:31:21,096 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 3 states. [2019-12-07 20:31:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:21,114 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-12-07 20:31:21,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:31:21,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 20:31:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:21,115 INFO L225 Difference]: With dead ends: 37 [2019-12-07 20:31:21,115 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 20:31:21,115 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:31:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 20:31:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 20:31:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 20:31:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-12-07 20:31:21,118 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 4 [2019-12-07 20:31:21,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:21,118 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-12-07 20:31:21,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:31:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-12-07 20:31:21,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:31:21,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:21,119 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 20:31:21,119 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:21,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 148560768, now seen corresponding path program 1 times [2019-12-07 20:31:21,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:21,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113425292] [2019-12-07 20:31:21,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:21,175 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:31:21,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113425292] [2019-12-07 20:31:21,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136898179] [2019-12-07 20:31:21,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:21,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 20:31:21,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:21,244 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_42|], 2=[|v_#valid_62|]} [2019-12-07 20:31:21,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:31:21,262 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:31:21,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:21,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:21,279 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 38 treesize of output 34 [2019-12-07 20:31:21,280 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:21,297 INFO L614 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-12-07 20:31:21,298 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:31:21,298 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-12-07 20:31:21,316 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:31:21,316 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:21,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:31:21,363 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:31:21,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [376571295] [2019-12-07 20:31:21,379 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 20:31:21,379 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:31:21,383 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:31:21,387 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:31:21,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:31:21,709 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:21,716 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:21,847 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:31:22,089 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:31:22,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:31:22,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-12-07 20:31:22,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778961586] [2019-12-07 20:31:22,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:31:22,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:31:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:31:22,090 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 9 states. [2019-12-07 20:31:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:22,242 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2019-12-07 20:31:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:31:22,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-12-07 20:31:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:22,243 INFO L225 Difference]: With dead ends: 99 [2019-12-07 20:31:22,243 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 20:31:22,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-07 20:31:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 20:31:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 34. [2019-12-07 20:31:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 20:31:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-12-07 20:31:22,246 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 5 [2019-12-07 20:31:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:22,247 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-12-07 20:31:22,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:31:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-12-07 20:31:22,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:31:22,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:22,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:31:22,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:22,448 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:22,448 INFO L82 PathProgramCache]: Analyzing trace with hash 151548454, now seen corresponding path program 1 times [2019-12-07 20:31:22,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:22,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533886308] [2019-12-07 20:31:22,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:22,474 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:31:22,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533886308] [2019-12-07 20:31:22,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:22,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:31:22,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140600285] [2019-12-07 20:31:22,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:31:22,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:31:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:31:22,477 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2019-12-07 20:31:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:22,524 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-12-07 20:31:22,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:31:22,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 20:31:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:22,526 INFO L225 Difference]: With dead ends: 33 [2019-12-07 20:31:22,526 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 20:31:22,527 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:31:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 20:31:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 20:31:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 20:31:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-12-07 20:31:22,532 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 5 [2019-12-07 20:31:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:22,532 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-12-07 20:31:22,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:31:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-12-07 20:31:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 20:31:22,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:22,533 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 20:31:22,534 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash 400626091, now seen corresponding path program 1 times [2019-12-07 20:31:22,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:22,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618588538] [2019-12-07 20:31:22,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:22,614 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:31:22,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618588538] [2019-12-07 20:31:22,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686528918] [2019-12-07 20:31:22,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:22,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:31:22,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:22,739 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:31:22,740 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:22,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:31:22,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1005630040] [2019-12-07 20:31:22,799 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 20:31:22,799 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:31:22,799 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:31:22,799 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:31:22,799 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:31:23,036 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:23,061 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:23,161 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:31:23,408 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 20:31:23,559 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:31:23,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:31:23,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-12-07 20:31:23,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580488225] [2019-12-07 20:31:23,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:31:23,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:31:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:31:23,560 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 10 states. [2019-12-07 20:31:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:23,697 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-12-07 20:31:23,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:31:23,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-12-07 20:31:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:23,698 INFO L225 Difference]: With dead ends: 83 [2019-12-07 20:31:23,698 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 20:31:23,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:31:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 20:31:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 30. [2019-12-07 20:31:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 20:31:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-12-07 20:31:23,700 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2019-12-07 20:31:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:23,701 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-12-07 20:31:23,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:31:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-12-07 20:31:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:31:23,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:23,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:23,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:23,902 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash -390761238, now seen corresponding path program 1 times [2019-12-07 20:31:23,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:23,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615624018] [2019-12-07 20:31:23,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:23,952 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:31:23,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615624018] [2019-12-07 20:31:23,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:23,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:31:23,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716273824] [2019-12-07 20:31:23,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:23,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:23,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:23,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:23,953 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-12-07 20:31:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:23,979 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2019-12-07 20:31:23,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:23,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 20:31:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:23,980 INFO L225 Difference]: With dead ends: 28 [2019-12-07 20:31:23,980 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 20:31:23,980 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:31:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 20:31:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 20:31:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 20:31:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-12-07 20:31:23,982 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 7 [2019-12-07 20:31:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:23,982 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-12-07 20:31:23,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-12-07 20:31:23,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:31:23,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:23,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:23,983 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash -390761237, now seen corresponding path program 1 times [2019-12-07 20:31:23,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:23,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611002956] [2019-12-07 20:31:23,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,017 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:31:24,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611002956] [2019-12-07 20:31:24,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:31:24,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2499905] [2019-12-07 20:31:24,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:31:24,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:31:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:31:24,018 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2019-12-07 20:31:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,052 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-12-07 20:31:24,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:24,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 20:31:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,053 INFO L225 Difference]: With dead ends: 40 [2019-12-07 20:31:24,053 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 20:31:24,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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:31:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 20:31:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2019-12-07 20:31:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 20:31:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-12-07 20:31:24,055 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 7 [2019-12-07 20:31:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,055 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-12-07 20:31:24,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:31:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-12-07 20:31:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:31:24,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,055 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash 771302905, now seen corresponding path program 1 times [2019-12-07 20:31:24,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746888434] [2019-12-07 20:31:24,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,101 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:31:24,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746888434] [2019-12-07 20:31:24,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:31:24,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395188083] [2019-12-07 20:31:24,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:24,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:24,102 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2019-12-07 20:31:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,125 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-12-07 20:31:24,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:24,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 20:31:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,126 INFO L225 Difference]: With dead ends: 31 [2019-12-07 20:31:24,126 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 20:31:24,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:31:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 20:31:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 20:31:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 20:31:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-12-07 20:31:24,128 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 8 [2019-12-07 20:31:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,128 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-12-07 20:31:24,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-12-07 20:31:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:31:24,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,129 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,129 INFO L82 PathProgramCache]: Analyzing trace with hash 771305038, now seen corresponding path program 1 times [2019-12-07 20:31:24,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041889148] [2019-12-07 20:31:24,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,150 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:31:24,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041889148] [2019-12-07 20:31:24,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:31:24,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281286353] [2019-12-07 20:31:24,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:24,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:24,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:24,151 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-12-07 20:31:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,172 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-12-07 20:31:24,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:24,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 20:31:24,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,172 INFO L225 Difference]: With dead ends: 27 [2019-12-07 20:31:24,172 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 20:31:24,173 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:31:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 20:31:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 20:31:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 20:31:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-12-07 20:31:24,174 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 8 [2019-12-07 20:31:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,174 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 20:31:24,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-12-07 20:31:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 20:31:24,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,175 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash 771305039, now seen corresponding path program 1 times [2019-12-07 20:31:24,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95591795] [2019-12-07 20:31:24,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,205 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:31:24,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95591795] [2019-12-07 20:31:24,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:31:24,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710179518] [2019-12-07 20:31:24,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:31:24,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:31:24,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:31:24,206 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 5 states. [2019-12-07 20:31:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,251 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-12-07 20:31:24,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:31:24,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 20:31:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,252 INFO L225 Difference]: With dead ends: 27 [2019-12-07 20:31:24,252 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 20:31:24,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:31:24,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 20:31:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 20:31:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 20:31:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-12-07 20:31:24,253 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 8 [2019-12-07 20:31:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,253 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-12-07 20:31:24,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:31:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-12-07 20:31:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:31:24,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,254 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1805198929, now seen corresponding path program 1 times [2019-12-07 20:31:24,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906303025] [2019-12-07 20:31:24,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,269 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:31:24,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906303025] [2019-12-07 20:31:24,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:31:24,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014736518] [2019-12-07 20:31:24,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:24,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:24,271 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-12-07 20:31:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,299 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-12-07 20:31:24,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:24,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 20:31:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,300 INFO L225 Difference]: With dead ends: 26 [2019-12-07 20:31:24,300 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 20:31:24,300 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:31:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 20:31:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 20:31:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 20:31:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 20:31:24,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2019-12-07 20:31:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,302 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 20:31:24,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 20:31:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:31:24,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,303 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1805198928, now seen corresponding path program 1 times [2019-12-07 20:31:24,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710168890] [2019-12-07 20:31:24,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,338 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:31:24,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710168890] [2019-12-07 20:31:24,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:31:24,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154064393] [2019-12-07 20:31:24,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:31:24,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:31:24,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:31:24,339 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2019-12-07 20:31:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,378 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-12-07 20:31:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:31:24,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 20:31:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,378 INFO L225 Difference]: With dead ends: 30 [2019-12-07 20:31:24,378 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 20:31:24,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:31:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 20:31:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-12-07 20:31:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 20:31:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-12-07 20:31:24,380 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2019-12-07 20:31:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,380 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-12-07 20:31:24,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:31:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-12-07 20:31:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:31:24,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,380 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash -126600612, now seen corresponding path program 1 times [2019-12-07 20:31:24,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618193947] [2019-12-07 20:31:24,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,398 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:31:24,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618193947] [2019-12-07 20:31:24,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:31:24,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230829811] [2019-12-07 20:31:24,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:24,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:24,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:24,400 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-12-07 20:31:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,420 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-12-07 20:31:24,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:31:24,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 20:31:24,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,421 INFO L225 Difference]: With dead ends: 26 [2019-12-07 20:31:24,421 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 20:31:24,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:31:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 20:31:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 20:31:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 20:31:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 20:31:24,422 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2019-12-07 20:31:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,422 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 20:31:24,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 20:31:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:31:24,423 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,423 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash -126600611, now seen corresponding path program 1 times [2019-12-07 20:31:24,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142406841] [2019-12-07 20:31:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,470 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:31:24,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142406841] [2019-12-07 20:31:24,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 20:31:24,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423810332] [2019-12-07 20:31:24,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:31:24,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:31:24,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:31:24,472 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-12-07 20:31:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,563 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-12-07 20:31:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:31:24,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-07 20:31:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,564 INFO L225 Difference]: With dead ends: 31 [2019-12-07 20:31:24,564 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 20:31:24,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:31:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 20:31:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-12-07 20:31:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 20:31:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-12-07 20:31:24,566 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2019-12-07 20:31:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,566 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-12-07 20:31:24,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:31:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-12-07 20:31:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:31:24,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,566 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1395691926, now seen corresponding path program 1 times [2019-12-07 20:31:24,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065959613] [2019-12-07 20:31:24,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,702 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:31:24,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065959613] [2019-12-07 20:31:24,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:24,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:31:24,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277196422] [2019-12-07 20:31:24,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:31:24,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:24,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:31:24,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:31:24,704 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2019-12-07 20:31:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:24,911 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-12-07 20:31:24,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:31:24,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-12-07 20:31:24,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:24,912 INFO L225 Difference]: With dead ends: 37 [2019-12-07 20:31:24,912 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 20:31:24,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:31:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 20:31:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-12-07 20:31:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 20:31:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-12-07 20:31:24,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2019-12-07 20:31:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:24,913 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-12-07 20:31:24,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:31:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-12-07 20:31:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:31:24,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:24,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:24,914 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:24,914 INFO L82 PathProgramCache]: Analyzing trace with hash 576312871, now seen corresponding path program 1 times [2019-12-07 20:31:24,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:24,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539360384] [2019-12-07 20:31:24,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:24,972 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:31:24,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539360384] [2019-12-07 20:31:24,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840284509] [2019-12-07 20:31:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:25,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 20:31:25,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:25,049 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:31:25,049 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:25,114 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:31:25,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1217339962] [2019-12-07 20:31:25,115 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-12-07 20:31:25,115 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:31:25,116 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:31:25,116 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:31:25,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:31:25,328 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:25,334 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:25,520 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:31:26,189 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 20:31:26,457 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-12-07 20:31:26,794 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99 [2019-12-07 20:31:27,191 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 103 [2019-12-07 20:31:27,583 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 101 [2019-12-07 20:31:28,133 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 105 [2019-12-07 20:31:28,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:31:28,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7, 6, 6] total 28 [2019-12-07 20:31:28,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674342938] [2019-12-07 20:31:28,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 20:31:28,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:28,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 20:31:28,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2019-12-07 20:31:28,137 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2019-12-07 20:31:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:28,263 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-12-07 20:31:28,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:31:28,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-07 20:31:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:28,264 INFO L225 Difference]: With dead ends: 36 [2019-12-07 20:31:28,264 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 20:31:28,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2019-12-07 20:31:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 20:31:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-12-07 20:31:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 20:31:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-12-07 20:31:28,265 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2019-12-07 20:31:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:28,265 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-12-07 20:31:28,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 20:31:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-12-07 20:31:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:31:28,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:28,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:28,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:28,467 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:28,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1833901542, now seen corresponding path program 1 times [2019-12-07 20:31:28,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:28,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934798958] [2019-12-07 20:31:28,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:28,519 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:31:28,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934798958] [2019-12-07 20:31:28,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519104503] [2019-12-07 20:31:28,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:28,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 20:31:28,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:28,608 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:31:28,608 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:28,674 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:31:28,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [58246300] [2019-12-07 20:31:28,676 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 20:31:28,676 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:31:28,676 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:31:28,676 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:31:28,676 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:31:28,888 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:28,900 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:29,390 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:31:29,706 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 90 [2019-12-07 20:31:30,515 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 20:31:31,041 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 122 [2019-12-07 20:31:31,700 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 138 [2019-12-07 20:31:31,883 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 20:31:32,069 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 20:31:32,286 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:32,660 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:32,661 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:31:32,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:31:32,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2019-12-07 20:31:32,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490009080] [2019-12-07 20:31:32,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 20:31:32,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:32,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 20:31:32,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2019-12-07 20:31:32,664 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 18 states. [2019-12-07 20:31:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:33,326 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-12-07 20:31:33,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:31:33,328 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-12-07 20:31:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:33,329 INFO L225 Difference]: With dead ends: 35 [2019-12-07 20:31:33,329 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 20:31:33,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 20:31:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 20:31:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-12-07 20:31:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 20:31:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-12-07 20:31:33,335 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2019-12-07 20:31:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:33,336 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-12-07 20:31:33,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 20:31:33,337 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-12-07 20:31:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:31:33,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:33,339 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:31:33,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:33,541 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:33,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1016371456, now seen corresponding path program 1 times [2019-12-07 20:31:33,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:33,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442348199] [2019-12-07 20:31:33,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:33,622 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:31:33,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442348199] [2019-12-07 20:31:33,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507387844] [2019-12-07 20:31:33,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:33,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 20:31:33,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:33,691 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:31:33,692 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:33,761 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:31:33,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [404498090] [2019-12-07 20:31:33,762 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 20:31:33,762 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:31:33,763 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:31:33,763 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:31:33,763 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:31:33,964 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:33,969 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:34,477 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:31:34,817 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 99 [2019-12-07 20:31:35,308 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-07 20:31:35,702 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-12-07 20:31:36,188 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 20:31:36,782 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 122 [2019-12-07 20:31:37,523 WARN L192 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 138 [2019-12-07 20:31:37,794 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 20:31:38,054 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 20:31:38,420 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:38,817 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:38,818 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:31:38,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:31:38,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-12-07 20:31:38,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777529527] [2019-12-07 20:31:38,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 20:31:38,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:38,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 20:31:38,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2019-12-07 20:31:38,820 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 17 states. [2019-12-07 20:31:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:39,606 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-12-07 20:31:39,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:31:39,607 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-12-07 20:31:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:39,608 INFO L225 Difference]: With dead ends: 31 [2019-12-07 20:31:39,609 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 20:31:39,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 20:31:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 20:31:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-12-07 20:31:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 20:31:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-12-07 20:31:39,614 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-12-07 20:31:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:39,614 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-12-07 20:31:39,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 20:31:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-12-07 20:31:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 20:31:39,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:39,616 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:39,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:39,817 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1775392223, now seen corresponding path program 1 times [2019-12-07 20:31:39,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:39,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244835742] [2019-12-07 20:31:39,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:31:39,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244835742] [2019-12-07 20:31:39,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573476518] [2019-12-07 20:31:39,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:39,951 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 20:31:39,952 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:31:40,111 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:31:40,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1173728117] [2019-12-07 20:31:40,264 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 20:31:40,264 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:31:40,264 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:31:40,264 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:31:40,264 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:31:40,456 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:40,467 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:40,898 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:31:41,090 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-07 20:31:41,942 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 20:31:42,512 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 122 [2019-12-07 20:31:43,267 WARN L192 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 138 [2019-12-07 20:31:43,463 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 20:31:43,667 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 20:31:43,899 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:44,126 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:44,127 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:31:44,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:31:44,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-12-07 20:31:44,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885049786] [2019-12-07 20:31:44,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 20:31:44,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 20:31:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1389, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 20:31:44,128 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 26 states. [2019-12-07 20:31:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:44,704 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-12-07 20:31:44,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 20:31:44,704 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 20 [2019-12-07 20:31:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:44,705 INFO L225 Difference]: With dead ends: 35 [2019-12-07 20:31:44,705 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 20:31:44,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=354, Invalid=2196, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 20:31:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 20:31:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-12-07 20:31:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 20:31:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-12-07 20:31:44,707 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2019-12-07 20:31:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:44,707 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-12-07 20:31:44,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 20:31:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-12-07 20:31:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:31:44,707 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:44,707 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:44,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:44,909 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash 797407244, now seen corresponding path program 1 times [2019-12-07 20:31:44,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:44,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685765120] [2019-12-07 20:31:44,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:31:45,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685765120] [2019-12-07 20:31:45,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400735782] [2019-12-07 20:31:45,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:45,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 20:31:45,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:45,091 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:31:45,091 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:45,177 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:31:45,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1401329697] [2019-12-07 20:31:45,178 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 20:31:45,178 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:31:45,178 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:31:45,179 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:31:45,179 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:31:45,369 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:45,383 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 20:31:45,805 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:31:46,032 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-12-07 20:31:46,792 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-12-07 20:31:47,327 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 122 [2019-12-07 20:31:47,992 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 138 [2019-12-07 20:31:48,183 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 20:31:48,572 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-12-07 20:31:48,815 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:49,079 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:49,363 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-12-07 20:31:49,910 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 20:31:49,911 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:31:49,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:31:49,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2019-12-07 20:31:49,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006706536] [2019-12-07 20:31:49,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 20:31:49,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:49,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 20:31:49,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 20:31:49,914 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 19 states. [2019-12-07 20:31:50,692 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-12-07 20:31:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:51,353 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-12-07 20:31:51,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:31:51,355 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-12-07 20:31:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:51,356 INFO L225 Difference]: With dead ends: 37 [2019-12-07 20:31:51,356 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 20:31:51,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=227, Invalid=1579, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 20:31:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 20:31:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-12-07 20:31:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 20:31:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-12-07 20:31:51,362 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2019-12-07 20:31:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:51,362 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-12-07 20:31:51,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 20:31:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-12-07 20:31:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 20:31:51,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:51,365 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:51,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:51,566 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:51,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:51,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1812593753, now seen corresponding path program 2 times [2019-12-07 20:31:51,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:31:51,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981196609] [2019-12-07 20:31:51,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:31:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:31:51,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981196609] [2019-12-07 20:31:51,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687591140] [2019-12-07 20:31:51,799 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:51,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 20:31:51,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:31:51,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 20:31:51,848 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:31:52,094 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:54,258 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 20:31:54,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1113930546] [2019-12-07 20:31:54,259 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 20:31:54,259 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:31:54,259 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:31:54,259 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:31:54,259 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:31:54,265 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5c0b87b7 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:31:54,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:31:54,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-12-07 20:31:54,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588230104] [2019-12-07 20:31:54,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:31:54,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:31:54,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:31:54,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=681, Unknown=1, NotChecked=0, Total=756 [2019-12-07 20:31:54,268 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2019-12-07 20:31:54,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 20:31:54,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:31:54,470 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@5c0b87b7 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:31:54,477 INFO L168 Benchmark]: Toolchain (without parser) took 34674.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 403.2 MB). Free memory was 939.8 MB in the beginning and 817.2 MB in the end (delta: 122.5 MB). Peak memory consumption was 525.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:54,477 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:31:54,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:54,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.56 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:31:54,479 INFO L168 Benchmark]: Boogie Preprocessor took 19.00 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:31:54,480 INFO L168 Benchmark]: RCFGBuilder took 333.77 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.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:54,481 INFO L168 Benchmark]: TraceAbstraction took 33971.77 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.1 MB). Free memory was 1.0 GB in the beginning and 817.2 MB in the end (delta: 231.3 MB). Peak memory consumption was 525.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:31:54,485 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.56 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.00 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 333.77 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.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33971.77 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.1 MB). Free memory was 1.0 GB in the beginning and 817.2 MB in the end (delta: 231.3 MB). Peak memory consumption was 525.4 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@5c0b87b7 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5c0b87b7: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 20:31:55,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:31:55,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:31:55,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:31:55,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:31:55,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:31:55,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:31:55,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:31:55,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:31:55,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:31:55,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:31:55,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:31:55,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:31:55,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:31:55,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:31:55,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:31:55,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:31:55,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:31:55,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:31:55,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:31:55,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:31:55,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:31:55,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:31:55,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:31:55,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:31:55,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:31:55,853 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:31:55,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:31:55,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:31:55,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:31:55,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:31:55,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:31:55,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:31:55,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:31:55,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:31:55,857 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:31:55,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:31:55,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:31:55,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:31:55,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:31:55,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:31:55,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 20:31:55,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:31:55,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:31:55,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:31:55,871 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:31:55,871 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:31:55,871 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:31:55,871 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:31:55,871 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:31:55,871 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:31:55,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 20:31:55,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 20:31:55,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:31:55,872 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:31:55,872 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:31:55,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:31:55,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:31:55,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:31:55,873 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 20:31:55,873 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 20:31:55,873 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 20:31:55,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:31:55,873 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:31:55,873 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 20:31:55,873 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 20:31:55,874 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:31:55,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:31:55,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:31:55,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 20:31:55,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:31:55,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:31:55,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:31:55,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:31:55,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:31:55,875 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 20:31:55,875 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 20:31:55,875 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:31:55,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:31:55,875 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_e33449de-6384-406f-8c65-3508595fdbd2/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 -> f3eebd0d696af164582cbeee8be4a910d35e299c [2019-12-07 20:31:56,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:31:56,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:31:56,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:31:56,058 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:31:56,059 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:31:56,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2019-12-07 20:31:56,106 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data/34b6740ad/8b7565f20b364dfaae68c55aedfad3b6/FLAG3f866adc8 [2019-12-07 20:31:56,476 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:31:56,477 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca-2.i [2019-12-07 20:31:56,487 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data/34b6740ad/8b7565f20b364dfaae68c55aedfad3b6/FLAG3f866adc8 [2019-12-07 20:31:56,496 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/data/34b6740ad/8b7565f20b364dfaae68c55aedfad3b6 [2019-12-07 20:31:56,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:31:56,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:31:56,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:31:56,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:31:56,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:31:56,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5e3eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56, skipping insertion in model container [2019-12-07 20:31:56,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:31:56,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:31:56,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:31:56,759 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:31:56,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:31:56,830 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:31:56,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56 WrapperNode [2019-12-07 20:31:56,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:31:56,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:31:56,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:31:56,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:31:56,837 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:31:56" (1/1) ... [2019-12-07 20:31:56,849 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:31:56" (1/1) ... [2019-12-07 20:31:56,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:31:56,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:31:56,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:31:56,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:31:56,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (1/1) ... [2019-12-07 20:31:56,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:31:56,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:31:56,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:31:56,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:31:56,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 20:31:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:31:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 20:31:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:31:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:31:56,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:31:57,212 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:31:57,212 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 20:31:57,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:31:57 BoogieIcfgContainer [2019-12-07 20:31:57,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:31:57,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:31:57,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:31:57,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:31:57,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:31:56" (1/3) ... [2019-12-07 20:31:57,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9e4981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:31:57, skipping insertion in model container [2019-12-07 20:31:57,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:31:56" (2/3) ... [2019-12-07 20:31:57,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9e4981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:31:57, skipping insertion in model container [2019-12-07 20:31:57,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:31:57" (3/3) ... [2019-12-07 20:31:57,218 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca-2.i [2019-12-07 20:31:57,224 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:31:57,229 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 20:31:57,236 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 20:31:57,248 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:31:57,248 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 20:31:57,248 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:31:57,248 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:31:57,248 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:31:57,249 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:31:57,249 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:31:57,249 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:31:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-12-07 20:31:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:31:57,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:57,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:57,264 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:57,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2019-12-07 20:31:57,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:31:57,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151111671] [2019-12-07 20:31:57,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:57,322 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:31:57,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:57,360 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:31:57,361 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:57,383 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:31:57,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151111671] [2019-12-07 20:31:57,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:57,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 20:31:57,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723139763] [2019-12-07 20:31:57,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:31:57,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:31:57,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:31:57,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:31:57,399 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 6 states. [2019-12-07 20:31:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:57,497 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2019-12-07 20:31:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:31:57,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 20:31:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:57,506 INFO L225 Difference]: With dead ends: 100 [2019-12-07 20:31:57,506 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 20:31:57,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:31:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 20:31:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2019-12-07 20:31:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 20:31:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-12-07 20:31:57,532 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 7 [2019-12-07 20:31:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:57,532 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-12-07 20:31:57,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:31:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-12-07 20:31:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:31:57,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:57,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:57,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 20:31:57,735 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:57,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2019-12-07 20:31:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:31:57,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616585751] [2019-12-07 20:31:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:57,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:31:57,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:57,857 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:31:57,857 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:31:57,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:57,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:57,866 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:31:57,867 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 20:31:57,880 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:31:57,880 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:57,891 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:31:57,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616585751] [2019-12-07 20:31:57,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:57,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 20:31:57,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266831036] [2019-12-07 20:31:57,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:31:57,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:31:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:31:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:31:57,894 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2019-12-07 20:31:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:57,972 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-12-07 20:31:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:31:57,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 20:31:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:57,974 INFO L225 Difference]: With dead ends: 53 [2019-12-07 20:31:57,974 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 20:31:57,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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:31:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 20:31:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 20:31:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 20:31:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-12-07 20:31:57,981 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 7 [2019-12-07 20:31:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:57,981 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-12-07 20:31:57,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:31:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-12-07 20:31:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:31:57,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:57,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:58,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 20:31:58,184 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2019-12-07 20:31:58,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:31:58,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925562595] [2019-12-07 20:31:58,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:58,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:31:58,274 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:58,284 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_33|]} [2019-12-07 20:31:58,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:31:58,292 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:31:58,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:58,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:58,321 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:31:58,321 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:58,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:58,338 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:31:58,338 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-12-07 20:31:58,352 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:31:58,352 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:58,445 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:31:58,452 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:31:58,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:58,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:58,462 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 20:31:58,462 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:58,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:58,469 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:31:58,469 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 20:31:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:31:58,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925562595] [2019-12-07 20:31:58,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:58,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 20:31:58,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11432069] [2019-12-07 20:31:58,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:31:58,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:31:58,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:31:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:31:58,487 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 6 states. [2019-12-07 20:31:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:58,953 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2019-12-07 20:31:58,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:31:58,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 20:31:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:58,956 INFO L225 Difference]: With dead ends: 97 [2019-12-07 20:31:58,956 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 20:31:58,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:31:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 20:31:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2019-12-07 20:31:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 20:31:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-12-07 20:31:58,961 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 7 [2019-12-07 20:31:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:58,961 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-12-07 20:31:58,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:31:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-12-07 20:31:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:31:58,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:58,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:31:59,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 20:31:59,164 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:31:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:31:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2019-12-07 20:31:59,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:31:59,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032065664] [2019-12-07 20:31:59,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:31:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:31:59,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:31:59,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:31:59,259 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_26|], 1=[|v_#valid_35|]} [2019-12-07 20:31:59,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:31:59,263 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:31:59,264 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:59,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:59,279 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:31:59,280 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:59,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:59,291 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:31:59,291 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 20:31:59,300 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:31:59,300 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:31:59,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:31:59,384 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:31:59,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:31:59,391 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:31:59,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:31:59,394 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:31:59,394 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:31:59,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2019-12-07 20:31:59,415 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:31:59,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032065664] [2019-12-07 20:31:59,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:31:59,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 20:31:59,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83541154] [2019-12-07 20:31:59,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:31:59,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:31:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:31:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:31:59,416 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 6 states. [2019-12-07 20:31:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:31:59,814 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2019-12-07 20:31:59,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:31:59,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 20:31:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:31:59,817 INFO L225 Difference]: With dead ends: 93 [2019-12-07 20:31:59,817 INFO L226 Difference]: Without dead ends: 93 [2019-12-07 20:31:59,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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:31:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-07 20:31:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-12-07 20:31:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 20:31:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-12-07 20:31:59,821 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2019-12-07 20:31:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:31:59,821 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-12-07 20:31:59,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:31:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-12-07 20:31:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:31:59,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:31:59,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:00,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 20:32:00,024 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2019-12-07 20:32:00,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:00,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378898456] [2019-12-07 20:32:00,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:00,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:32:00,062 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:00,072 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:32:00,072 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:00,090 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:32:00,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378898456] [2019-12-07 20:32:00,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:00,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 20:32:00,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642713960] [2019-12-07 20:32:00,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:32:00,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:32:00,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:32:00,092 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 6 states. [2019-12-07 20:32:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:00,147 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-12-07 20:32:00,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:32:00,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 20:32:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:00,149 INFO L225 Difference]: With dead ends: 98 [2019-12-07 20:32:00,149 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 20:32:00,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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:32:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 20:32:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 65. [2019-12-07 20:32:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 20:32:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-12-07 20:32:00,154 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 9 [2019-12-07 20:32:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:00,154 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-12-07 20:32:00,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:32:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-12-07 20:32:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:32:00,155 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:00,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:00,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 20:32:00,357 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:00,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:00,357 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2019-12-07 20:32:00,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:00,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122567946] [2019-12-07 20:32:00,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:00,441 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 20:32:00,442 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:00,465 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:32:00,466 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:32:00,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:00,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:00,474 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:32:00,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 20:32:00,482 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:32:00,482 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:00,485 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:32:00,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122567946] [2019-12-07 20:32:00,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:00,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 20:32:00,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267650754] [2019-12-07 20:32:00,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:32:00,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:32:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:32:00,486 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 3 states. [2019-12-07 20:32:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:00,558 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2019-12-07 20:32:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:32:00,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 20:32:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:00,559 INFO L225 Difference]: With dead ends: 63 [2019-12-07 20:32:00,559 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 20:32:00,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:32:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 20:32:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-12-07 20:32:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-12-07 20:32:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2019-12-07 20:32:00,564 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 9 [2019-12-07 20:32:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:00,564 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2019-12-07 20:32:00,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:32:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2019-12-07 20:32:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 20:32:00,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:00,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:00,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 20:32:00,767 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:00,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:00,768 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2019-12-07 20:32:00,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085096327] [2019-12-07 20:32:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 20:32:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:00,838 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:32:00,839 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:00,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:00,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 25 [2019-12-07 20:32:00,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:00,895 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 20:32:00,895 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:32:00,895 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-12-07 20:32:00,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:32:00,924 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:01,052 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:32:01,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085096327] [2019-12-07 20:32:01,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:01,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 20:32:01,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621744237] [2019-12-07 20:32:01,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:32:01,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:01,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:32:01,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:32:01,053 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand 8 states. [2019-12-07 20:32:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:01,400 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-12-07 20:32:01,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:32:01,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 20:32:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:01,402 INFO L225 Difference]: With dead ends: 98 [2019-12-07 20:32:01,402 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 20:32:01,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 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:32:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 20:32:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 65. [2019-12-07 20:32:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 20:32:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-12-07 20:32:01,406 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 9 [2019-12-07 20:32:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:01,406 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-12-07 20:32:01,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:32:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-12-07 20:32:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 20:32:01,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:01,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:01,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 20:32:01,608 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:01,609 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2019-12-07 20:32:01,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:01,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023990927] [2019-12-07 20:32:01,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 20:32:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:01,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:32:01,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:01,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:01,671 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:32:01,672 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:01,714 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 20:32:01,715 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:32:01,715 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 20:32:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:32:01,726 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:01,820 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:32:01,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023990927] [2019-12-07 20:32:01,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:01,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 20:32:01,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600838245] [2019-12-07 20:32:01,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:32:01,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:32:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:32:01,822 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 6 states. [2019-12-07 20:32:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:02,030 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2019-12-07 20:32:02,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:32:02,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 20:32:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:02,032 INFO L225 Difference]: With dead ends: 95 [2019-12-07 20:32:02,032 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 20:32:02,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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:32:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 20:32:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2019-12-07 20:32:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 20:32:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2019-12-07 20:32:02,035 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 10 [2019-12-07 20:32:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:02,035 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2019-12-07 20:32:02,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:32:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2019-12-07 20:32:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 20:32:02,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:02,036 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:02,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 20:32:02,236 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2019-12-07 20:32:02,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:02,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821450210] [2019-12-07 20:32:02,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:02,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:32:02,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:02,277 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_34|], 1=[|v_#valid_42|]} [2019-12-07 20:32:02,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:32:02,283 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:32:02,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:02,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:02,306 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:32:02,306 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:02,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:02,321 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:32:02,321 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:32:02,448 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:32:02,448 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:02,907 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:32:02,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:32:02,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:02,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:02,912 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:32:02,912 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:32:02,912 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2019-12-07 20:32:02,912 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:32:02,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821450210] [2019-12-07 20:32:02,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724826057] [2019-12-07 20:32:02,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:02,974 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:32:02,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:02,979 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_36|], 1=[|v_#valid_44|]} [2019-12-07 20:32:02,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:32:02,985 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:32:02,985 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:03,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:03,008 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:32:03,008 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:03,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:03,023 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:32:03,023 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 20:32:03,127 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:32:03,127 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:03,540 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 20:32:03,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:32:03,544 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:03,545 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:03,545 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 20:32:03,545 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:32:03,545 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 20:32:03,545 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:32:03,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623063509] [2019-12-07 20:32:03,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:03,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:32:03,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:03,596 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_38|], 1=[|v_#valid_46|]} [2019-12-07 20:32:03,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 20:32:03,600 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:32:03,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:03,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:03,616 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:32:03,616 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:03,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:03,626 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:32:03,627 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 20:32:03,765 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:32:03,765 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:03,771 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:32:03,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:32:03,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 4, 5] total 18 [2019-12-07 20:32:03,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612199305] [2019-12-07 20:32:03,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 20:32:03,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:03,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 20:32:03,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:32:03,772 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 19 states. [2019-12-07 20:32:04,329 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 20:32:04,573 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 20:32:05,129 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 20:32:05,713 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-07 20:32:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:06,390 INFO L93 Difference]: Finished difference Result 248 states and 287 transitions. [2019-12-07 20:32:06,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:32:06,391 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2019-12-07 20:32:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:06,392 INFO L225 Difference]: With dead ends: 248 [2019-12-07 20:32:06,392 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 20:32:06,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-07 20:32:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 20:32:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 88. [2019-12-07 20:32:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 20:32:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2019-12-07 20:32:06,397 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 11 [2019-12-07 20:32:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:06,397 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2019-12-07 20:32:06,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 20:32:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2019-12-07 20:32:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:32:06,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:06,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:06,998 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:32:07,000 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1518446106, now seen corresponding path program 1 times [2019-12-07 20:32:07,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:07,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983608144] [2019-12-07 20:32:07,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:07,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:32:07,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:07,075 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:32:07,075 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:07,077 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:32:07,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983608144] [2019-12-07 20:32:07,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:07,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 20:32:07,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604437529] [2019-12-07 20:32:07,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:32:07,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:07,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:32:07,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:32:07,078 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2019-12-07 20:32:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:07,146 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2019-12-07 20:32:07,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:32:07,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 20:32:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:07,148 INFO L225 Difference]: With dead ends: 86 [2019-12-07 20:32:07,149 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 20:32:07,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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:32:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 20:32:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-07 20:32:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 20:32:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-12-07 20:32:07,153 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 13 [2019-12-07 20:32:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:07,153 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-12-07 20:32:07,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:32:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-12-07 20:32:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:32:07,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:07,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:07,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 20:32:07,356 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1518446105, now seen corresponding path program 1 times [2019-12-07 20:32:07,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:07,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000715846] [2019-12-07 20:32:07,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:07,454 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:32:07,455 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:07,500 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:32:07,501 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:07,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:32:07,589 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 16 treesize of output 12 [2019-12-07 20:32:07,590 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:32:07,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 20:32:07,600 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:32:07,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:07,625 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:32:07,626 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 20:32:07,752 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:32:07,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000715846] [2019-12-07 20:32:07,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:07,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 20:32:07,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292667334] [2019-12-07 20:32:07,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:32:07,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:32:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:32:07,753 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 10 states. [2019-12-07 20:32:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:08,403 INFO L93 Difference]: Finished difference Result 158 states and 180 transitions. [2019-12-07 20:32:08,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:32:08,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-07 20:32:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:08,405 INFO L225 Difference]: With dead ends: 158 [2019-12-07 20:32:08,405 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 20:32:08,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:32:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 20:32:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 86. [2019-12-07 20:32:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 20:32:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2019-12-07 20:32:08,408 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 13 [2019-12-07 20:32:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:08,408 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2019-12-07 20:32:08,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:32:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2019-12-07 20:32:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:32:08,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:08,408 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:08,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 20:32:08,610 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2019-12-07 20:32:08,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:08,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798067595] [2019-12-07 20:32:08,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:08,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:32:08,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:08,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:08,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-07 20:32:08,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:08,747 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 20:32:08,747 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:32:08,748 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 20:32:08,833 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:32:08,833 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:09,230 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:32:09,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798067595] [2019-12-07 20:32:09,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [595608082] [2019-12-07 20:32:09,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 20:32:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:09,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:32:09,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:09,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:09,312 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:32:09,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:09,343 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 20:32:09,343 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:32:09,344 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 20:32:09,346 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:32:09,346 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:09,352 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:32:09,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84371336] [2019-12-07 20:32:09,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:09,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 20:32:09,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:09,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:09,403 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:32:09,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:09,431 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 20:32:09,431 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:32:09,432 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 20:32:09,510 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:32:09,510 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:10,249 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:32:10,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 20:32:10,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2019-12-07 20:32:10,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717756858] [2019-12-07 20:32:10,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 20:32:10,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 20:32:10,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:32:10,250 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 17 states. [2019-12-07 20:32:11,106 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-12-07 20:32:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:11,554 INFO L93 Difference]: Finished difference Result 147 states and 173 transitions. [2019-12-07 20:32:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:32:11,555 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 20:32:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:11,555 INFO L225 Difference]: With dead ends: 147 [2019-12-07 20:32:11,556 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 20:32:11,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-07 20:32:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 20:32:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 83. [2019-12-07 20:32:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 20:32:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-12-07 20:32:11,559 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 13 [2019-12-07 20:32:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:11,559 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-12-07 20:32:11,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 20:32:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-12-07 20:32:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:32:11,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:11,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:12,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:32:12,162 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:12,163 INFO L82 PathProgramCache]: Analyzing trace with hash 172810365, now seen corresponding path program 1 times [2019-12-07 20:32:12,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:12,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372031733] [2019-12-07 20:32:12,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 20:32:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:12,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 20:32:12,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:12,250 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:32:12,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:12,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:12,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:32:12,252 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 20:32:14,296 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:32:14,296 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:18,530 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:32:18,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372031733] [2019-12-07 20:32:18,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:18,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 20:32:18,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463130849] [2019-12-07 20:32:18,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:32:18,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:18,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:32:18,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=45, Unknown=3, NotChecked=0, Total=72 [2019-12-07 20:32:18,532 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 9 states. [2019-12-07 20:32:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:28,680 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2019-12-07 20:32:28,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:32:28,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-12-07 20:32:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:28,681 INFO L225 Difference]: With dead ends: 82 [2019-12-07 20:32:28,681 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 20:32:28,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=29, Invalid=58, Unknown=3, NotChecked=0, Total=90 [2019-12-07 20:32:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 20:32:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 20:32:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 20:32:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2019-12-07 20:32:28,683 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 14 [2019-12-07 20:32:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:28,683 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2019-12-07 20:32:28,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:32:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2019-12-07 20:32:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:32:28,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:28,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:28,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 20:32:28,885 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:28,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1062174023, now seen corresponding path program 1 times [2019-12-07 20:32:28,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:28,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729434598] [2019-12-07 20:32:28,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:28,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:32:28,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:28,948 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:32:28,949 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:32:28,949 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:28,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:28,953 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:32:28,953 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 20:32:28,968 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:32:28,968 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:28,972 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:32:28,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729434598] [2019-12-07 20:32:28,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:28,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 20:32:28,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646550131] [2019-12-07 20:32:28,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:32:28,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:32:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:32:28,973 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 5 states. [2019-12-07 20:32:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:29,070 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-12-07 20:32:29,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:32:29,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-07 20:32:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:29,071 INFO L225 Difference]: With dead ends: 77 [2019-12-07 20:32:29,071 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 20:32:29,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 1 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:32:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 20:32:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-12-07 20:32:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 20:32:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2019-12-07 20:32:29,072 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 15 [2019-12-07 20:32:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:29,073 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2019-12-07 20:32:29,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:32:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2019-12-07 20:32:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 20:32:29,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:29,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:29,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 20:32:29,274 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1062174024, now seen corresponding path program 1 times [2019-12-07 20:32:29,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:29,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316272849] [2019-12-07 20:32:29,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:29,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 20:32:29,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:29,404 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:29,404 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:32:29,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:29,423 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 20:32:29,423 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:32:29,424 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 20:32:29,445 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:32:29,445 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:29,586 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:32:29,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316272849] [2019-12-07 20:32:29,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:29,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-12-07 20:32:29,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096740892] [2019-12-07 20:32:29,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 20:32:29,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:29,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 20:32:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:32:29,587 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 10 states. [2019-12-07 20:32:30,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:30,169 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2019-12-07 20:32:30,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 20:32:30,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-07 20:32:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:30,171 INFO L225 Difference]: With dead ends: 105 [2019-12-07 20:32:30,171 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 20:32:30,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-12-07 20:32:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 20:32:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 79. [2019-12-07 20:32:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 20:32:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2019-12-07 20:32:30,174 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 15 [2019-12-07 20:32:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:30,174 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2019-12-07 20:32:30,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 20:32:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2019-12-07 20:32:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:32:30,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:30,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:30,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 20:32:30,376 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:30,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:30,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1452978584, now seen corresponding path program 1 times [2019-12-07 20:32:30,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:30,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498879043] [2019-12-07 20:32:30,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:30,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:32:30,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:30,448 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:32:30,448 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:32:30,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498879043] [2019-12-07 20:32:30,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:30,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 20:32:30,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928642041] [2019-12-07 20:32:30,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:32:30,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:32:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:32:30,459 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 5 states. [2019-12-07 20:32:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:30,557 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2019-12-07 20:32:30,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:32:30,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 20:32:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:30,559 INFO L225 Difference]: With dead ends: 78 [2019-12-07 20:32:30,559 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 20:32:30,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 3 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:32:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 20:32:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 20:32:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 20:32:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2019-12-07 20:32:30,561 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 17 [2019-12-07 20:32:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:30,561 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2019-12-07 20:32:30,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:32:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2019-12-07 20:32:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:32:30,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:30,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:30,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 20:32:30,762 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1452978583, now seen corresponding path program 1 times [2019-12-07 20:32:30,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:30,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742600505] [2019-12-07 20:32:30,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 20:32:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:30,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:32:30,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:30,945 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:32:30,945 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:31,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 20:32:31,094 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 16 treesize of output 12 [2019-12-07 20:32:31,095 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:32:31,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 20:32:31,107 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:32:31,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:31,135 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:32:31,135 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 20:32:31,295 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:32:31,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742600505] [2019-12-07 20:32:31,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:31,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 20:32:31,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130634260] [2019-12-07 20:32:31,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:32:31,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:32:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:32:31,297 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 12 states. [2019-12-07 20:32:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:32,313 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2019-12-07 20:32:32,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 20:32:32,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-12-07 20:32:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:32,315 INFO L225 Difference]: With dead ends: 122 [2019-12-07 20:32:32,315 INFO L226 Difference]: Without dead ends: 122 [2019-12-07 20:32:32,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-12-07 20:32:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-07 20:32:32,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-12-07 20:32:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 20:32:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2019-12-07 20:32:32,317 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 17 [2019-12-07 20:32:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:32,317 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2019-12-07 20:32:32,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:32:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2019-12-07 20:32:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:32:32,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:32,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:32,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 20:32:32,518 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:32,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash -448353975, now seen corresponding path program 1 times [2019-12-07 20:32:32,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:32,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426802108] [2019-12-07 20:32:32,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 20:32:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:32,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 20:32:32,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:32,617 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 20:32:32,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 20:32:32,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:32,620 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:32,621 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:32:32,621 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 20:32:32,636 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:32:32,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:32,646 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:32:32,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426802108] [2019-12-07 20:32:32,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:32,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 20:32:32,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355563075] [2019-12-07 20:32:32,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:32:32,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:32,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:32:32,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:32:32,647 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 5 states. [2019-12-07 20:32:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:32,733 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2019-12-07 20:32:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:32:32,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 20:32:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:32,734 INFO L225 Difference]: With dead ends: 76 [2019-12-07 20:32:32,734 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 20:32:32,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 4 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:32:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 20:32:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-07 20:32:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 20:32:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2019-12-07 20:32:32,735 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 19 [2019-12-07 20:32:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:32,736 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2019-12-07 20:32:32,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:32:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2019-12-07 20:32:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:32:32,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:32,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:32:32,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 20:32:32,937 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash -448353974, now seen corresponding path program 1 times [2019-12-07 20:32:32,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:32,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563850781] [2019-12-07 20:32:32,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:32,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 20:32:32,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:33,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:33,000 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:32:33,000 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:33,022 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 20:32:33,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:32:33,023 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 20:32:33,064 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:32:33,064 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:33,274 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:32:33,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563850781] [2019-12-07 20:32:33,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:33,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 20:32:33,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050053786] [2019-12-07 20:32:33,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:32:33,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 20:32:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:32:33,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:32:33,276 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 12 states. [2019-12-07 20:32:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:32:34,143 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-12-07 20:32:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:32:34,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-07 20:32:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:32:34,145 INFO L225 Difference]: With dead ends: 120 [2019-12-07 20:32:34,145 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 20:32:34,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:32:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 20:32:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 77. [2019-12-07 20:32:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 20:32:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2019-12-07 20:32:34,148 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 19 [2019-12-07 20:32:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:32:34,149 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2019-12-07 20:32:34,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:32:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2019-12-07 20:32:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:32:34,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:32:34,150 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:32:34,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 20:32:34,351 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.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 20:32:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:32:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1075479959, now seen corresponding path program 1 times [2019-12-07 20:32:34,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 20:32:34,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555110304] [2019-12-07 20:32:34,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:34,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 20:32:34,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:34,460 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:32:34,460 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 20:32:34,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:34,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 20:32:34,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 20:32:34,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:34,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2019-12-07 20:32:34,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:32:34,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:32:34,579 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:32:34,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 20:32:34,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 20:32:34,592 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 20:32:34,592 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-12-07 20:32:34,618 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:32:34,618 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:32:34,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555110304] [2019-12-07 20:32:34,825 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 20:32:34,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1131525426] [2019-12-07 20:32:34,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:34,913 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 20:32:34,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:34,915 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4de45fe0 [2019-12-07 20:32:34,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876264914] [2019-12-07 20:32:34,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e33449de-6384-406f-8c65-3508595fdbd2/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:32:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:32:34,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 20:32:34,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:32:34,956 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4de45fe0 [2019-12-07 20:32:34,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:32:34,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 20:32:34,956 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 20:32:34,956 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:32:35,560 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:32:35,574 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 20:32:35,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:32:35 BoogieIcfgContainer [2019-12-07 20:32:35,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:32:35,575 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:32:35,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:32:35,575 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:32:35,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:31:57" (3/4) ... [2019-12-07 20:32:35,577 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 20:32:35,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:32:35,578 INFO L168 Benchmark]: Toolchain (without parser) took 39079.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 947.0 MB in the beginning and 1.3 GB in the end (delta: -322.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:32:35,578 INFO L168 Benchmark]: CDTParser took 0.17 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:32:35,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:32:35,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:32:35,579 INFO L168 Benchmark]: Boogie Preprocessor took 21.96 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:32:35,579 INFO L168 Benchmark]: RCFGBuilder took 327.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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:32:35,579 INFO L168 Benchmark]: TraceAbstraction took 38360.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -193.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:32:35,579 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:32:35,581 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.96 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 327.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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38360.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -193.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 519]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L527] int length1 = __VERIFIER_nondet_int(); [L528] int length2 = __VERIFIER_nondet_int(); [L529] COND TRUE length1 < 1 [L530] length1 = 1 [L532] COND TRUE length2 < 1 [L533] length2 = 1 [L535] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L536] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L538] int i = 0; [L538] COND FALSE !(i< length1 -1) [L543] int i = 0; [L543] COND FALSE !(i< length2 -1) [L548] nondetString1[length1-1] = '\0' [L549] nondetString2[length2-1] = '\0' [L516] COND FALSE !(n == 0) [L519] EXPR \read(*s1) [L519] EXPR s2++ [L519] COND FALSE !(*s1 != *s2++) [L521] EXPR s1++ [L521] COND FALSE !(*s1++ == 0) [L523] EXPR --n [L523] COND TRUE --n != 0 [L519] \read(*s1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 19 error locations. Result: UNKNOWN, OverallTime: 38.3s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 659 SDtfs, 4088 SDslu, 1330 SDs, 0 SdLazy, 1316 SolverSat, 150 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 385 SyntacticMatches, 16 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 623 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 516 ConstructedInterpolants, 18 QuantifiedInterpolants, 55790 SizeOfPredicates, 145 NumberOfNonLiveVariables, 1040 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 46 InterpolantComputations, 34 PerfectInterpolantSequences, 0/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...