./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-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_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 f4732dd3bead498dcfa33caf242cd74b12e0ffa3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 f4732dd3bead498dcfa33caf242cd74b12e0ffa3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:49:21,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:49:21,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:49:21,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:49:21,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:49:21,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:49:21,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:49:21,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:49:21,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:49:21,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:49:21,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:49:21,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:49:21,603 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:49:21,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:49:21,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:49:21,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:49:21,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:49:21,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:49:21,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:49:21,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:49:21,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:49:21,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:49:21,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:49:21,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:49:21,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:49:21,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:49:21,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:49:21,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:49:21,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:49:21,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:49:21,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:49:21,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:49:21,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:49:21,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:49:21,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:49:21,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:49:21,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:49:21,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:49:21,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:49:21,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:49:21,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:49:21,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 13:49:21,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:49:21,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:49:21,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:49:21,636 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:49:21,636 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:49:21,637 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:49:21,637 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:49:21,637 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:49:21,637 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:49:21,637 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:49:21,638 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:49:21,638 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:49:21,638 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:49:21,638 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:49:21,638 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:49:21,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:49:21,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:49:21,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:49:21,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:49:21,640 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:49:21,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:49:21,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:49:21,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:49:21,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:49:21,641 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:49:21,641 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:49:21,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:49:21,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:49:21,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:49:21,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:49:21,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:49:21,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:49:21,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:49:21,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:49:21,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:49:21,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:49:21,643 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:49:21,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:49:21,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:49:21,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:49:21,643 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_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 -> f4732dd3bead498dcfa33caf242cd74b12e0ffa3 [2019-12-07 13:49:21,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:49:21,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:49:21,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:49:21,764 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:49:21,764 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:49:21,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2019-12-07 13:49:21,803 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data/6cc5e14eb/086c92e4a3af4edca9549666c09327f5/FLAG313e10f0c [2019-12-07 13:49:22,173 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:49:22,174 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2019-12-07 13:49:22,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data/6cc5e14eb/086c92e4a3af4edca9549666c09327f5/FLAG313e10f0c [2019-12-07 13:49:22,192 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data/6cc5e14eb/086c92e4a3af4edca9549666c09327f5 [2019-12-07 13:49:22,194 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:49:22,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:49:22,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:49:22,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:49:22,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:49:22,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eba8e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22, skipping insertion in model container [2019-12-07 13:49:22,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:49:22,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:49:22,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:49:22,433 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:49:22,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:49:22,491 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:49:22,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22 WrapperNode [2019-12-07 13:49:22,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:49:22,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:49:22,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:49:22,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:49:22,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:49:22,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:49:22,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:49:22,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:49:22,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... [2019-12-07 13:49:22,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:49:22,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:49:22,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:49:22,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:49:22,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:49:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:49:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:49:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:49:22,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:49:22,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:49:22,841 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:49:22,841 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 13:49:22,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:49:22 BoogieIcfgContainer [2019-12-07 13:49:22,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:49:22,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:49:22,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:49:22,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:49:22,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:49:22" (1/3) ... [2019-12-07 13:49:22,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fcbb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:49:22, skipping insertion in model container [2019-12-07 13:49:22,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:49:22" (2/3) ... [2019-12-07 13:49:22,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fcbb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:49:22, skipping insertion in model container [2019-12-07 13:49:22,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:49:22" (3/3) ... [2019-12-07 13:49:22,847 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-2.i [2019-12-07 13:49:22,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:49:22,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-12-07 13:49:22,865 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-12-07 13:49:22,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:49:22,878 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:49:22,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:49:22,878 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:49:22,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:49:22,879 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:49:22,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:49:22,879 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:49:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-12-07 13:49:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:49:22,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:22,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:49:22,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash 142966, now seen corresponding path program 1 times [2019-12-07 13:49:22,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:22,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716998115] [2019-12-07 13:49:22,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:23,014 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 13:49:23,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716998115] [2019-12-07 13:49:23,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:23,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:49:23,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741267380] [2019-12-07 13:49:23,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:49:23,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:23,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:49:23,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:49:23,029 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-12-07 13:49:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:23,061 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-12-07 13:49:23,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:49:23,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:49:23,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:23,068 INFO L225 Difference]: With dead ends: 27 [2019-12-07 13:49:23,068 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 13:49:23,069 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 13:49:23,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 13:49:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 13:49:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 13:49:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-12-07 13:49:23,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 3 [2019-12-07 13:49:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:23,092 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-12-07 13:49:23,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:49:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-12-07 13:49:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:49:23,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:23,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:49:23,092 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:23,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:23,093 INFO L82 PathProgramCache]: Analyzing trace with hash 142967, now seen corresponding path program 1 times [2019-12-07 13:49:23,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:23,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883689468] [2019-12-07 13:49:23,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:23,139 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 13:49:23,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883689468] [2019-12-07 13:49:23,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:23,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:49:23,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826299513] [2019-12-07 13:49:23,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:49:23,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:23,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:49:23,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:49:23,142 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2019-12-07 13:49:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:23,202 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-12-07 13:49:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:49:23,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 13:49:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:23,204 INFO L225 Difference]: With dead ends: 50 [2019-12-07 13:49:23,204 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 13:49:23,205 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 13:49:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 13:49:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 28. [2019-12-07 13:49:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 13:49:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 13:49:23,209 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 3 [2019-12-07 13:49:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:23,209 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 13:49:23,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:49:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 13:49:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 13:49:23,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:23,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 13:49:23,210 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:23,210 INFO L82 PathProgramCache]: Analyzing trace with hash 4519264, now seen corresponding path program 1 times [2019-12-07 13:49:23,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:23,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013403763] [2019-12-07 13:49:23,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:23,265 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 13:49:23,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013403763] [2019-12-07 13:49:23,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:23,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:49:23,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226802969] [2019-12-07 13:49:23,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:49:23,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:23,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:49:23,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:49:23,267 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-12-07 13:49:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:23,284 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-12-07 13:49:23,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:49:23,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 13:49:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:23,285 INFO L225 Difference]: With dead ends: 27 [2019-12-07 13:49:23,285 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 13:49:23,285 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 13:49:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 13:49:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 13:49:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 13:49:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-12-07 13:49:23,287 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 4 [2019-12-07 13:49:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:23,288 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 13:49:23,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:49:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-12-07 13:49:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 13:49:23,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:23,288 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 13:49:23,288 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:23,288 INFO L82 PathProgramCache]: Analyzing trace with hash 4517053, now seen corresponding path program 1 times [2019-12-07 13:49:23,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:23,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495246912] [2019-12-07 13:49:23,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:23,309 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 13:49:23,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495246912] [2019-12-07 13:49:23,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:23,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:49:23,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083571816] [2019-12-07 13:49:23,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:49:23,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:49:23,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:49:23,310 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-12-07 13:49:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:23,325 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-12-07 13:49:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:49:23,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 13:49:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:23,325 INFO L225 Difference]: With dead ends: 25 [2019-12-07 13:49:23,326 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 13:49:23,326 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 13:49:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 13:49:23,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-12-07 13:49:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 13:49:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-12-07 13:49:23,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 4 [2019-12-07 13:49:23,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:23,328 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-12-07 13:49:23,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:49:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-12-07 13:49:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 13:49:23,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:23,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 13:49:23,329 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash 4517054, now seen corresponding path program 1 times [2019-12-07 13:49:23,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:23,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611606188] [2019-12-07 13:49:23,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:23,364 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 13:49:23,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611606188] [2019-12-07 13:49:23,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:23,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:49:23,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771149195] [2019-12-07 13:49:23,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:49:23,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:23,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:49:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:49:23,365 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2019-12-07 13:49:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:23,414 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-12-07 13:49:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:49:23,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-12-07 13:49:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:23,415 INFO L225 Difference]: With dead ends: 43 [2019-12-07 13:49:23,415 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 13:49:23,416 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 13:49:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 13:49:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2019-12-07 13:49:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 13:49:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-12-07 13:49:23,418 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 4 [2019-12-07 13:49:23,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:23,418 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 13:49:23,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:49:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-12-07 13:49:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:49:23,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:23,419 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-12-07 13:49:23,419 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash 137466984, now seen corresponding path program 1 times [2019-12-07 13:49:23,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:23,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145717535] [2019-12-07 13:49:23,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:23,467 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 13:49:23,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145717535] [2019-12-07 13:49:23,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130705726] [2019-12-07 13:49:23,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:23,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 13:49:23,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:23,529 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_34|], 2=[|v_#valid_54|]} [2019-12-07 13:49:23,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:49:23,543 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 13:49:23,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:49:23,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:49:23,558 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 13:49:23,558 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:49:23,573 INFO L614 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-12-07 13:49:23,574 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 13:49:23,574 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-12-07 13:49:23,592 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 13:49:23,592 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:23,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:49:23,634 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 13:49:23,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1694928294] [2019-12-07 13:49:23,649 INFO L159 IcfgInterpreter]: Started Sifa with 4 locations of interest [2019-12-07 13:49:23,650 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:23,653 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:23,657 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:23,658 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:24,004 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:24,022 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:24,190 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:49:24,452 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:49:24,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:49:24,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-12-07 13:49:24,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509899686] [2019-12-07 13:49:24,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:49:24,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:49:24,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:49:24,454 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 9 states. [2019-12-07 13:49:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:24,573 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2019-12-07 13:49:24,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:49:24,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-12-07 13:49:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:24,574 INFO L225 Difference]: With dead ends: 69 [2019-12-07 13:49:24,574 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 13:49:24,575 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 13:49:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 13:49:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-12-07 13:49:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:49:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-12-07 13:49:24,579 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 5 [2019-12-07 13:49:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:24,579 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-12-07 13:49:24,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:49:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-12-07 13:49:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:49:24,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:24,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:49:24,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:24,781 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:24,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash 140097178, now seen corresponding path program 1 times [2019-12-07 13:49:24,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:24,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098430324] [2019-12-07 13:49:24,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:24,862 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 13:49:24,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098430324] [2019-12-07 13:49:24,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:24,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:49:24,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085560740] [2019-12-07 13:49:24,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:49:24,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:49:24,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:49:24,868 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2019-12-07 13:49:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:24,916 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-12-07 13:49:24,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:49:24,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:49:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:24,918 INFO L225 Difference]: With dead ends: 23 [2019-12-07 13:49:24,918 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 13:49:24,918 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 13:49:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 13:49:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 13:49:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 13:49:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-12-07 13:49:24,924 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 5 [2019-12-07 13:49:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:24,924 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-12-07 13:49:24,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:49:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-12-07 13:49:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 13:49:24,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:24,925 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-07 13:49:24,926 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash 45981534, now seen corresponding path program 1 times [2019-12-07 13:49:24,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:24,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586816638] [2019-12-07 13:49:24,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:24,980 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 13:49:24,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586816638] [2019-12-07 13:49:24,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041658195] [2019-12-07 13:49:24,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:25,007 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:49:25,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:25,043 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 13:49:25,043 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:25,087 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 13:49:25,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [373778033] [2019-12-07 13:49:25,088 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2019-12-07 13:49:25,088 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:25,088 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:25,088 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:25,089 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:25,319 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:25,324 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:25,410 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:49:25,665 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:49:25,818 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:49:25,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:49:25,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2019-12-07 13:49:25,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774008619] [2019-12-07 13:49:25,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:49:25,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:49:25,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:49:25,819 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2019-12-07 13:49:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:25,923 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2019-12-07 13:49:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:49:25,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-12-07 13:49:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:25,924 INFO L225 Difference]: With dead ends: 53 [2019-12-07 13:49:25,924 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 13:49:25,925 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 13:49:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 13:49:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 20. [2019-12-07 13:49:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 13:49:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 13:49:25,927 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 6 [2019-12-07 13:49:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:25,927 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 13:49:25,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:49:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 13:49:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:49:25,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:25,927 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:26,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:26,129 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:26,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1489452975, now seen corresponding path program 1 times [2019-12-07 13:49:26,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:26,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256400833] [2019-12-07 13:49:26,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:26,179 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 13:49:26,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256400833] [2019-12-07 13:49:26,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:26,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:49:26,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710110888] [2019-12-07 13:49:26,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:49:26,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:26,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:49:26,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:49:26,180 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2019-12-07 13:49:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:26,210 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-12-07 13:49:26,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:49:26,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 13:49:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:26,211 INFO L225 Difference]: With dead ends: 19 [2019-12-07 13:49:26,211 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 13:49:26,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:49:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 13:49:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 13:49:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 13:49:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-12-07 13:49:26,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2019-12-07 13:49:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:26,213 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-12-07 13:49:26,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:49:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-12-07 13:49:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:49:26,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:26,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:26,213 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1489452976, now seen corresponding path program 1 times [2019-12-07 13:49:26,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:26,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171713405] [2019-12-07 13:49:26,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:26,246 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 13:49:26,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171713405] [2019-12-07 13:49:26,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:26,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:49:26,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518909168] [2019-12-07 13:49:26,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:49:26,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:26,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:49:26,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:49:26,247 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 6 states. [2019-12-07 13:49:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:26,280 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-12-07 13:49:26,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:49:26,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 13:49:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:26,281 INFO L225 Difference]: With dead ends: 21 [2019-12-07 13:49:26,281 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 13:49:26,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:49:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 13:49:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 13:49:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 13:49:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-12-07 13:49:26,282 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2019-12-07 13:49:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:26,283 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-12-07 13:49:26,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:49:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-12-07 13:49:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:49:26,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:26,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:26,283 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1140239224, now seen corresponding path program 1 times [2019-12-07 13:49:26,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:26,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29235499] [2019-12-07 13:49:26,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:26,302 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 13:49:26,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29235499] [2019-12-07 13:49:26,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:26,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:49:26,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368394932] [2019-12-07 13:49:26,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:49:26,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:26,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:49:26,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:49:26,303 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-12-07 13:49:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:26,333 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-12-07 13:49:26,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:49:26,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 13:49:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:26,334 INFO L225 Difference]: With dead ends: 20 [2019-12-07 13:49:26,334 INFO L226 Difference]: Without dead ends: 20 [2019-12-07 13:49:26,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:49:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-07 13:49:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-07 13:49:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 13:49:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-12-07 13:49:26,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2019-12-07 13:49:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:26,336 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-12-07 13:49:26,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:49:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-12-07 13:49:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:49:26,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:26,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:26,336 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1140239225, now seen corresponding path program 1 times [2019-12-07 13:49:26,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:26,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979868628] [2019-12-07 13:49:26,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:26,371 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 13:49:26,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979868628] [2019-12-07 13:49:26,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:26,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:49:26,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099105293] [2019-12-07 13:49:26,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:49:26,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:26,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:49:26,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:49:26,372 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 6 states. [2019-12-07 13:49:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:26,426 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-12-07 13:49:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:49:26,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 13:49:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:26,427 INFO L225 Difference]: With dead ends: 23 [2019-12-07 13:49:26,427 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 13:49:26,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:49:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 13:49:26,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-12-07 13:49:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 13:49:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-12-07 13:49:26,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 9 [2019-12-07 13:49:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:26,429 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-12-07 13:49:26,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:49:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-12-07 13:49:26,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 13:49:26,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:26,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:26,430 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:26,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:26,430 INFO L82 PathProgramCache]: Analyzing trace with hash -28737601, now seen corresponding path program 1 times [2019-12-07 13:49:26,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:26,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91281715] [2019-12-07 13:49:26,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:26,467 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 13:49:26,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91281715] [2019-12-07 13:49:26,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:26,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:49:26,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005913901] [2019-12-07 13:49:26,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:49:26,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:26,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:49:26,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:49:26,468 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2019-12-07 13:49:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:26,482 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-12-07 13:49:26,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:49:26,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 13:49:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:26,482 INFO L225 Difference]: With dead ends: 21 [2019-12-07 13:49:26,483 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 13:49:26,483 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 13:49:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 13:49:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 13:49:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 13:49:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-12-07 13:49:26,485 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2019-12-07 13:49:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:26,485 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-12-07 13:49:26,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:49:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-12-07 13:49:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:49:26,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:26,485 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:26,486 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash -890815622, now seen corresponding path program 1 times [2019-12-07 13:49:26,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:26,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355289353] [2019-12-07 13:49:26,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:26,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355289353] [2019-12-07 13:49:26,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:26,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:49:26,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222504817] [2019-12-07 13:49:26,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:49:26,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:49:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:49:26,607 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 9 states. [2019-12-07 13:49:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:26,733 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2019-12-07 13:49:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:49:26,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-07 13:49:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:26,734 INFO L225 Difference]: With dead ends: 34 [2019-12-07 13:49:26,734 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 13:49:26,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:49:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 13:49:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-12-07 13:49:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 13:49:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-12-07 13:49:26,736 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 13 [2019-12-07 13:49:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:26,736 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-12-07 13:49:26,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:49:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-12-07 13:49:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:49:26,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:26,737 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:26,737 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash -890813444, now seen corresponding path program 1 times [2019-12-07 13:49:26,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:26,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621218202] [2019-12-07 13:49:26,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:26,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621218202] [2019-12-07 13:49:26,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:49:26,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:49:26,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311303488] [2019-12-07 13:49:26,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:49:26,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:26,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:49:26,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:49:26,830 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 9 states. [2019-12-07 13:49:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:27,083 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-12-07 13:49:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:49:27,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-07 13:49:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:27,084 INFO L225 Difference]: With dead ends: 59 [2019-12-07 13:49:27,084 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 13:49:27,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:49:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 13:49:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2019-12-07 13:49:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 13:49:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-12-07 13:49:27,087 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 13 [2019-12-07 13:49:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:27,087 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-12-07 13:49:27,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:49:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-12-07 13:49:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:49:27,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:27,087 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:27,088 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:27,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash 170436651, now seen corresponding path program 1 times [2019-12-07 13:49:27,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:27,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200828133] [2019-12-07 13:49:27,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:27,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200828133] [2019-12-07 13:49:27,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248352188] [2019-12-07 13:49:27,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:27,187 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 13:49:27,188 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:27,235 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:27,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1664329051] [2019-12-07 13:49:27,324 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:49:27,324 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:27,324 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:27,324 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:27,324 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:27,547 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:27,553 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:28,014 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:49:28,370 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 97 [2019-12-07 13:49:28,817 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-07 13:49:29,713 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-12-07 13:49:30,363 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 133 [2019-12-07 13:49:30,546 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 13:49:30,776 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 13:49:31,086 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-12-07 13:49:31,321 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-12-07 13:49:31,321 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:49:31,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:49:31,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2019-12-07 13:49:31,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717575383] [2019-12-07 13:49:31,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 13:49:31,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:31,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 13:49:31,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:49:31,323 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 20 states. [2019-12-07 13:49:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:31,549 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-12-07 13:49:31,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:49:31,549 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-07 13:49:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:31,550 INFO L225 Difference]: With dead ends: 60 [2019-12-07 13:49:31,550 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 13:49:31,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=232, Invalid=1328, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 13:49:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 13:49:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-12-07 13:49:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 13:49:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-12-07 13:49:31,553 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 15 [2019-12-07 13:49:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:31,553 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-12-07 13:49:31,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 13:49:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-12-07 13:49:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:49:31,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:31,554 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:31,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:31,755 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash -839023268, now seen corresponding path program 1 times [2019-12-07 13:49:31,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:31,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941132232] [2019-12-07 13:49:31,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:31,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941132232] [2019-12-07 13:49:31,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014975521] [2019-12-07 13:49:31,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:31,891 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 13:49:31,892 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:31,944 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:32,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [937901279] [2019-12-07 13:49:32,047 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:49:32,047 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:32,048 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:32,048 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:32,048 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:32,246 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:32,259 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:32,456 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:49:32,645 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-12-07 13:49:32,843 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:49:33,348 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-07 13:49:33,574 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 13:49:33,850 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 13:49:34,121 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 13:49:34,449 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 13:49:34,927 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 13:49:35,317 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 13:49:35,318 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:49:35,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:49:35,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2019-12-07 13:49:35,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204570338] [2019-12-07 13:49:35,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 13:49:35,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:35,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 13:49:35,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:49:35,320 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 20 states. [2019-12-07 13:49:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:35,707 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2019-12-07 13:49:35,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:49:35,709 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-07 13:49:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:35,711 INFO L225 Difference]: With dead ends: 79 [2019-12-07 13:49:35,712 INFO L226 Difference]: Without dead ends: 79 [2019-12-07 13:49:35,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 13:49:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-07 13:49:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2019-12-07 13:49:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 13:49:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-12-07 13:49:35,720 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 15 [2019-12-07 13:49:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:35,721 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-12-07 13:49:35,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 13:49:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-12-07 13:49:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:49:35,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:35,722 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:35,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:35,924 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:35,925 INFO L82 PathProgramCache]: Analyzing trace with hash -531073953, now seen corresponding path program 2 times [2019-12-07 13:49:35,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:35,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358816687] [2019-12-07 13:49:35,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:36,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358816687] [2019-12-07 13:49:36,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277107002] [2019-12-07 13:49:36,081 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:36,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 13:49:36,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:49:36,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 13:49:36,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:36,327 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:36,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860925376] [2019-12-07 13:49:36,570 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:49:36,570 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:36,571 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:36,571 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:36,571 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:36,763 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:36,777 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:36,991 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:49:37,195 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-12-07 13:49:37,395 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:49:37,787 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-07 13:49:38,223 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 13:49:38,478 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 13:49:38,670 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 13:49:38,893 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 13:49:39,140 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 13:49:39,387 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 13:49:39,387 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:49:39,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:49:39,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-12-07 13:49:39,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236237375] [2019-12-07 13:49:39,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 13:49:39,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:39,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 13:49:39,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 13:49:39,389 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 29 states. [2019-12-07 13:49:40,538 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 13:49:41,057 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-12-07 13:49:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:41,775 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-12-07 13:49:41,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 13:49:41,775 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 19 [2019-12-07 13:49:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:41,776 INFO L225 Difference]: With dead ends: 119 [2019-12-07 13:49:41,776 INFO L226 Difference]: Without dead ends: 107 [2019-12-07 13:49:41,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=644, Invalid=3388, Unknown=0, NotChecked=0, Total=4032 [2019-12-07 13:49:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-12-07 13:49:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2019-12-07 13:49:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 13:49:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2019-12-07 13:49:41,780 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 19 [2019-12-07 13:49:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:41,780 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2019-12-07 13:49:41,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 13:49:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2019-12-07 13:49:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:49:41,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:41,781 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:41,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:41,983 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:41,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:41,983 INFO L82 PathProgramCache]: Analyzing trace with hash 574167989, now seen corresponding path program 2 times [2019-12-07 13:49:41,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:41,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526019599] [2019-12-07 13:49:41,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:42,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526019599] [2019-12-07 13:49:42,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845944510] [2019-12-07 13:49:42,212 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:42,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 13:49:42,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:49:42,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 13:49:42,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:42,473 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:42,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [166224520] [2019-12-07 13:49:42,683 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:49:42,683 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:42,683 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:42,683 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:42,683 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:42,887 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:42,907 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:43,282 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:49:43,704 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 93 [2019-12-07 13:49:45,046 WARN L192 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-12-07 13:49:46,100 WARN L192 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 119 [2019-12-07 13:49:46,583 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 13:49:47,066 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 13:49:47,344 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-12-07 13:49:47,601 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-12-07 13:49:47,602 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:49:47,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:49:47,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2019-12-07 13:49:47,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352509040] [2019-12-07 13:49:47,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 13:49:47,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:47,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 13:49:47,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1507, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 13:49:47,603 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand 29 states. [2019-12-07 13:49:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:48,337 INFO L93 Difference]: Finished difference Result 171 states and 191 transitions. [2019-12-07 13:49:48,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:49:48,338 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 21 [2019-12-07 13:49:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:48,338 INFO L225 Difference]: With dead ends: 171 [2019-12-07 13:49:48,338 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 13:49:48,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=333, Invalid=2529, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 13:49:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 13:49:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2019-12-07 13:49:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 13:49:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2019-12-07 13:49:48,342 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 21 [2019-12-07 13:49:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:48,342 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2019-12-07 13:49:48,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 13:49:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2019-12-07 13:49:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:49:48,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:48,343 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:48,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:48,545 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:48,546 INFO L82 PathProgramCache]: Analyzing trace with hash 105917887, now seen corresponding path program 3 times [2019-12-07 13:49:48,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:48,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936163713] [2019-12-07 13:49:48,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:48,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936163713] [2019-12-07 13:49:48,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116848076] [2019-12-07 13:49:48,659 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:48,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:49:48,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:49:48,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 13:49:48,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:48,838 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:49,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1265869495] [2019-12-07 13:49:49,026 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:49:49,026 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:49,026 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:49,026 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:49,027 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:49,223 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:49,228 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:49,413 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:49:49,608 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-12-07 13:49:49,801 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:49:50,211 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-07 13:49:50,691 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 13:49:51,023 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 13:49:51,373 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 13:49:51,603 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 13:49:51,852 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 13:49:52,085 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 13:49:52,085 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:49:52,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:49:52,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2019-12-07 13:49:52,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651207822] [2019-12-07 13:49:52,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 13:49:52,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 13:49:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1627, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 13:49:52,087 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand 31 states. [2019-12-07 13:49:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:53,005 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2019-12-07 13:49:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:49:53,005 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 21 [2019-12-07 13:49:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:53,006 INFO L225 Difference]: With dead ends: 155 [2019-12-07 13:49:53,006 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 13:49:53,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=439, Invalid=2641, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 13:49:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 13:49:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2019-12-07 13:49:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 13:49:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2019-12-07 13:49:53,009 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 21 [2019-12-07 13:49:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:53,009 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2019-12-07 13:49:53,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 13:49:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2019-12-07 13:49:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:49:53,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:53,011 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:53,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:53,212 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash -224442522, now seen corresponding path program 3 times [2019-12-07 13:49:53,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:53,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225448834] [2019-12-07 13:49:53,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:53,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225448834] [2019-12-07 13:49:53,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991064155] [2019-12-07 13:49:53,322 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:49:53,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:49:53,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:49:53,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 13:49:53,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:53,418 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:53,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1621760839] [2019-12-07 13:49:53,530 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:49:53,530 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:53,530 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:53,530 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:53,531 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:53,730 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:53,735 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:54,098 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:49:54,505 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 93 [2019-12-07 13:49:54,958 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-07 13:49:55,169 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-07 13:49:56,022 WARN L192 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-12-07 13:49:57,248 WARN L192 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 149 DAG size of output: 119 [2019-12-07 13:49:57,446 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 13:49:57,735 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 13:49:57,991 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-12-07 13:49:58,352 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-12-07 13:49:58,353 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:49:58,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:49:58,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2019-12-07 13:49:58,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539169264] [2019-12-07 13:49:58,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 13:49:58,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:49:58,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 13:49:58,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 13:49:58,355 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 23 states. [2019-12-07 13:49:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:49:58,709 INFO L93 Difference]: Finished difference Result 187 states and 213 transitions. [2019-12-07 13:49:58,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:49:58,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-12-07 13:49:58,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:49:58,711 INFO L225 Difference]: With dead ends: 187 [2019-12-07 13:49:58,711 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 13:49:58,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 13:49:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 13:49:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2019-12-07 13:49:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-12-07 13:49:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2019-12-07 13:49:58,714 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 23 [2019-12-07 13:49:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:49:58,714 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2019-12-07 13:49:58,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 13:49:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2019-12-07 13:49:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:49:58,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:49:58,715 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:49:58,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:58,916 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:49:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:49:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash -460704958, now seen corresponding path program 4 times [2019-12-07 13:49:58,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:49:58,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087893408] [2019-12-07 13:49:58,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:49:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:59,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087893408] [2019-12-07 13:49:59,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849392836] [2019-12-07 13:49:59,067 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:49:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:49:59,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 13:49:59,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:49:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:59,327 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:49:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:49:59,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496645144] [2019-12-07 13:49:59,548 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:49:59,548 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:49:59,548 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:49:59,548 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:49:59,548 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:49:59,725 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:59,730 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:49:59,927 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:50:00,145 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-12-07 13:50:00,360 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:50:00,818 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-12-07 13:50:01,081 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-07 13:50:01,375 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 13:50:01,701 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 13:50:01,953 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 13:50:02,233 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 13:50:02,500 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 13:50:02,759 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 13:50:02,760 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:50:02,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:50:02,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 36 [2019-12-07 13:50:02,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645037386] [2019-12-07 13:50:02,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 13:50:02,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 13:50:02,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2064, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 13:50:02,762 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand 36 states. [2019-12-07 13:50:05,033 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 13:50:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:06,627 INFO L93 Difference]: Finished difference Result 290 states and 327 transitions. [2019-12-07 13:50:06,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 13:50:06,627 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 25 [2019-12-07 13:50:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:06,628 INFO L225 Difference]: With dead ends: 290 [2019-12-07 13:50:06,628 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 13:50:06,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=746, Invalid=5574, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 13:50:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 13:50:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 219. [2019-12-07 13:50:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-12-07 13:50:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 256 transitions. [2019-12-07 13:50:06,635 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 256 transitions. Word has length 25 [2019-12-07 13:50:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:06,635 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 256 transitions. [2019-12-07 13:50:06,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 13:50:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 256 transitions. [2019-12-07 13:50:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:50:06,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:06,637 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:06,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:06,838 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:50:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1402379102, now seen corresponding path program 5 times [2019-12-07 13:50:06,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:06,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184378422] [2019-12-07 13:50:06,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:06,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184378422] [2019-12-07 13:50:06,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050501760] [2019-12-07 13:50:06,954 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:06,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 13:50:06,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:50:06,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-07 13:50:06,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:50:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:07,174 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:50:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:07,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048690764] [2019-12-07 13:50:07,420 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:50:07,420 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:50:07,420 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:50:07,421 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:50:07,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:50:07,625 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:07,638 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:07,820 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:50:08,034 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-12-07 13:50:08,303 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:50:08,515 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-12-07 13:50:09,168 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 13:50:09,417 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 13:50:09,620 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 13:50:09,834 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 13:50:10,114 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 13:50:10,355 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 13:50:10,356 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:50:10,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:50:10,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 35 [2019-12-07 13:50:10,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381388281] [2019-12-07 13:50:10,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-07 13:50:10,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-07 13:50:10,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2120, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 13:50:10,358 INFO L87 Difference]: Start difference. First operand 219 states and 256 transitions. Second operand 37 states. [2019-12-07 13:50:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:11,217 INFO L93 Difference]: Finished difference Result 274 states and 312 transitions. [2019-12-07 13:50:11,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:50:11,218 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 27 [2019-12-07 13:50:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:11,219 INFO L225 Difference]: With dead ends: 274 [2019-12-07 13:50:11,219 INFO L226 Difference]: Without dead ends: 274 [2019-12-07 13:50:11,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=651, Invalid=3639, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 13:50:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-12-07 13:50:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 239. [2019-12-07 13:50:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 13:50:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 280 transitions. [2019-12-07 13:50:11,224 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 280 transitions. Word has length 27 [2019-12-07 13:50:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:11,224 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 280 transitions. [2019-12-07 13:50:11,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-07 13:50:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 280 transitions. [2019-12-07 13:50:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:50:11,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:11,225 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:11,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:11,427 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:50:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1978916176, now seen corresponding path program 4 times [2019-12-07 13:50:11,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:11,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444592842] [2019-12-07 13:50:11,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:11,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444592842] [2019-12-07 13:50:11,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205726717] [2019-12-07 13:50:11,600 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:50:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:11,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 13:50:11,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:50:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:11,922 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:50:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:12,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [720645389] [2019-12-07 13:50:12,113 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:50:12,113 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:50:12,113 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:50:12,113 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:50:12,113 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:50:12,301 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:12,306 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:12,680 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:50:13,089 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 93 [2019-12-07 13:50:14,324 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-12-07 13:50:15,351 WARN L192 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 119 [2019-12-07 13:50:15,742 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 13:50:16,163 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 13:50:16,660 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-12-07 13:50:17,149 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-12-07 13:50:17,151 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:50:17,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:50:17,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2019-12-07 13:50:17,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298528880] [2019-12-07 13:50:17,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 13:50:17,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:17,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 13:50:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1752, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 13:50:17,153 INFO L87 Difference]: Start difference. First operand 239 states and 280 transitions. Second operand 32 states. [2019-12-07 13:50:17,757 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-12-07 13:50:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:19,019 INFO L93 Difference]: Finished difference Result 432 states and 488 transitions. [2019-12-07 13:50:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 13:50:19,019 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 [2019-12-07 13:50:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:19,021 INFO L225 Difference]: With dead ends: 432 [2019-12-07 13:50:19,021 INFO L226 Difference]: Without dead ends: 336 [2019-12-07 13:50:19,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=342, Invalid=3080, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 13:50:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-07 13:50:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 270. [2019-12-07 13:50:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-12-07 13:50:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 318 transitions. [2019-12-07 13:50:19,028 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 318 transitions. Word has length 29 [2019-12-07 13:50:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:19,028 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 318 transitions. [2019-12-07 13:50:19,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 13:50:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 318 transitions. [2019-12-07 13:50:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:50:19,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:19,029 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:19,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:19,230 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:50:19,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1771565727, now seen corresponding path program 5 times [2019-12-07 13:50:19,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:19,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524282318] [2019-12-07 13:50:19,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:19,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524282318] [2019-12-07 13:50:19,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119434685] [2019-12-07 13:50:19,372 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:19,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 13:50:19,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:50:19,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-07 13:50:19,434 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:50:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:19,560 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:50:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:19,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671941153] [2019-12-07 13:50:19,779 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:50:19,779 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:50:19,779 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:50:19,779 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:50:19,780 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:50:19,963 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:19,974 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:20,330 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:50:20,705 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 97 [2019-12-07 13:50:22,070 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-12-07 13:50:23,020 WARN L192 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 133 [2019-12-07 13:50:23,212 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 13:50:23,428 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 13:50:23,678 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-12-07 13:50:23,915 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-12-07 13:50:23,916 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:50:23,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:50:23,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-12-07 13:50:23,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826047418] [2019-12-07 13:50:23,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 13:50:23,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 13:50:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1589, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 13:50:23,918 INFO L87 Difference]: Start difference. First operand 270 states and 318 transitions. Second operand 31 states. [2019-12-07 13:50:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:24,475 INFO L93 Difference]: Finished difference Result 386 states and 443 transitions. [2019-12-07 13:50:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:50:24,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-12-07 13:50:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:24,477 INFO L225 Difference]: With dead ends: 386 [2019-12-07 13:50:24,477 INFO L226 Difference]: Without dead ends: 386 [2019-12-07 13:50:24,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=463, Invalid=2507, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 13:50:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-12-07 13:50:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 320. [2019-12-07 13:50:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-07 13:50:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 376 transitions. [2019-12-07 13:50:24,483 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 376 transitions. Word has length 31 [2019-12-07 13:50:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:24,483 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 376 transitions. [2019-12-07 13:50:24,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 13:50:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 376 transitions. [2019-12-07 13:50:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 13:50:24,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:24,484 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:24,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:24,685 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:50:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash -610844507, now seen corresponding path program 6 times [2019-12-07 13:50:24,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:24,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422507098] [2019-12-07 13:50:24,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:24,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422507098] [2019-12-07 13:50:24,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010444984] [2019-12-07 13:50:24,830 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:24,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:50:24,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:50:24,874 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 69 conjunts are in the unsatisfiable core [2019-12-07 13:50:24,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:50:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:25,753 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:50:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:27,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1512982280] [2019-12-07 13:50:27,018 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:50:27,018 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:50:27,018 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:50:27,018 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:50:27,018 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:50:27,199 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:27,209 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:27,398 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:50:27,650 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 13:50:27,911 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:50:28,626 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-12-07 13:50:29,010 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-12-07 13:50:29,331 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-12-07 13:50:29,563 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-07 13:50:29,816 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-07 13:50:30,109 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-12-07 13:50:30,391 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-12-07 13:50:30,392 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:50:30,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:50:30,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 20] total 49 [2019-12-07 13:50:30,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770810635] [2019-12-07 13:50:30,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 13:50:30,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 13:50:30,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=3459, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 13:50:30,394 INFO L87 Difference]: Start difference. First operand 320 states and 376 transitions. Second operand 50 states. [2019-12-07 13:50:33,402 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-07 13:50:34,181 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-07 13:50:35,811 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-07 13:50:37,008 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-12-07 13:50:37,749 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-07 13:50:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:38,906 INFO L93 Difference]: Finished difference Result 554 states and 628 transitions. [2019-12-07 13:50:38,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-07 13:50:38,906 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 31 [2019-12-07 13:50:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:38,908 INFO L225 Difference]: With dead ends: 554 [2019-12-07 13:50:38,908 INFO L226 Difference]: Without dead ends: 474 [2019-12-07 13:50:38,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4075 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1766, Invalid=14746, Unknown=0, NotChecked=0, Total=16512 [2019-12-07 13:50:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-07 13:50:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 404. [2019-12-07 13:50:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-12-07 13:50:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 474 transitions. [2019-12-07 13:50:38,917 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 474 transitions. Word has length 31 [2019-12-07 13:50:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:38,917 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 474 transitions. [2019-12-07 13:50:38,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 13:50:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 474 transitions. [2019-12-07 13:50:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:50:38,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:38,918 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:39,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:39,119 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:50:39,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:39,119 INFO L82 PathProgramCache]: Analyzing trace with hash -404493819, now seen corresponding path program 7 times [2019-12-07 13:50:39,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:39,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458279115] [2019-12-07 13:50:39,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:39,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458279115] [2019-12-07 13:50:39,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931307752] [2019-12-07 13:50:39,239 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:39,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 13:50:39,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:50:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:39,372 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:50:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:39,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1375916352] [2019-12-07 13:50:39,582 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:50:39,582 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:50:39,583 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:50:39,583 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:50:39,583 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:50:39,765 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:39,776 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:39,956 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:50:40,158 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-12-07 13:50:40,355 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:50:41,042 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 13:50:41,290 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 13:50:41,484 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 13:50:41,691 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 13:50:41,943 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 13:50:42,179 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 13:50:42,180 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:50:42,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:50:42,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 30 [2019-12-07 13:50:42,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854451329] [2019-12-07 13:50:42,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 13:50:42,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:42,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 13:50:42,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1635, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 13:50:42,181 INFO L87 Difference]: Start difference. First operand 404 states and 474 transitions. Second operand 31 states. [2019-12-07 13:50:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:43,079 INFO L93 Difference]: Finished difference Result 495 states and 567 transitions. [2019-12-07 13:50:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:50:43,079 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 33 [2019-12-07 13:50:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:43,081 INFO L225 Difference]: With dead ends: 495 [2019-12-07 13:50:43,081 INFO L226 Difference]: Without dead ends: 495 [2019-12-07 13:50:43,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=528, Invalid=3132, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 13:50:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-12-07 13:50:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 432. [2019-12-07 13:50:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-12-07 13:50:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 508 transitions. [2019-12-07 13:50:43,092 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 508 transitions. Word has length 33 [2019-12-07 13:50:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:43,092 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 508 transitions. [2019-12-07 13:50:43,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 13:50:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 508 transitions. [2019-12-07 13:50:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:50:43,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:43,093 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:43,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:43,294 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:50:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1093222507, now seen corresponding path program 6 times [2019-12-07 13:50:43,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:43,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487512787] [2019-12-07 13:50:43,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:43,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487512787] [2019-12-07 13:50:43,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434345004] [2019-12-07 13:50:43,483 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:43,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:50:43,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:50:43,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 64 conjunts are in the unsatisfiable core [2019-12-07 13:50:43,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:50:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:44,080 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:50:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:45,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552816080] [2019-12-07 13:50:45,597 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:50:45,597 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:50:45,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:50:45,598 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:50:45,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:50:45,780 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:45,798 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:46,147 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:50:46,641 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 93 [2019-12-07 13:50:48,046 WARN L192 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-12-07 13:50:48,832 WARN L192 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 119 [2019-12-07 13:50:49,072 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 13:50:49,303 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 13:50:49,650 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-12-07 13:50:49,938 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-12-07 13:50:49,939 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:50:49,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:50:49,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2019-12-07 13:50:49,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946670660] [2019-12-07 13:50:49,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-07 13:50:49,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-07 13:50:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2767, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 13:50:49,940 INFO L87 Difference]: Start difference. First operand 432 states and 508 transitions. Second operand 43 states. [2019-12-07 13:50:50,734 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 13:50:51,427 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 13:50:53,359 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-07 13:50:53,758 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 13:50:54,347 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-07 13:50:54,615 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 13:50:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:55,893 INFO L93 Difference]: Finished difference Result 821 states and 937 transitions. [2019-12-07 13:50:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 13:50:55,893 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 37 [2019-12-07 13:50:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:55,895 INFO L225 Difference]: With dead ends: 821 [2019-12-07 13:50:55,896 INFO L226 Difference]: Without dead ends: 621 [2019-12-07 13:50:55,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=950, Invalid=8556, Unknown=0, NotChecked=0, Total=9506 [2019-12-07 13:50:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-12-07 13:50:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 469. [2019-12-07 13:50:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-12-07 13:50:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 553 transitions. [2019-12-07 13:50:55,902 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 553 transitions. Word has length 37 [2019-12-07 13:50:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:55,903 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 553 transitions. [2019-12-07 13:50:55,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-07 13:50:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 553 transitions. [2019-12-07 13:50:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 13:50:55,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:55,903 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:56,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:50:56,105 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:50:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 565861512, now seen corresponding path program 8 times [2019-12-07 13:50:56,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:50:56,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152896598] [2019-12-07 13:50:56,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:56,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152896598] [2019-12-07 13:50:56,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000973621] [2019-12-07 13:50:56,339 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:50:56,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 13:50:56,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:50:56,393 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 13:50:56,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:50:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:56,560 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:50:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:56,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [74297202] [2019-12-07 13:50:56,679 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:50:56,679 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:50:56,679 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:50:56,679 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:50:56,679 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:50:56,870 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:56,884 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:50:57,072 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:50:57,313 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-12-07 13:50:57,544 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:50:58,245 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 13:50:58,535 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 13:50:58,800 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 13:50:59,071 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 13:50:59,326 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 13:50:59,679 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 13:50:59,681 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:50:59,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:50:59,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 32 [2019-12-07 13:50:59,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963645158] [2019-12-07 13:50:59,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 13:50:59,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:50:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 13:50:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1736, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 13:50:59,682 INFO L87 Difference]: Start difference. First operand 469 states and 553 transitions. Second operand 32 states. [2019-12-07 13:51:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:02,796 INFO L93 Difference]: Finished difference Result 761 states and 873 transitions. [2019-12-07 13:51:02,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 13:51:02,796 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 37 [2019-12-07 13:51:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:02,798 INFO L225 Difference]: With dead ends: 761 [2019-12-07 13:51:02,798 INFO L226 Difference]: Without dead ends: 629 [2019-12-07 13:51:02,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=531, Invalid=4439, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 13:51:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-07 13:51:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 571. [2019-12-07 13:51:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 13:51:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 673 transitions. [2019-12-07 13:51:02,807 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 673 transitions. Word has length 37 [2019-12-07 13:51:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:02,807 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 673 transitions. [2019-12-07 13:51:02,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 13:51:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 673 transitions. [2019-12-07 13:51:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:51:02,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:02,809 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:03,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:03,009 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:03,010 INFO L82 PathProgramCache]: Analyzing trace with hash -749999588, now seen corresponding path program 7 times [2019-12-07 13:51:03,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:51:03,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271111624] [2019-12-07 13:51:03,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:03,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271111624] [2019-12-07 13:51:03,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444199846] [2019-12-07 13:51:03,138 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:03,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-07 13:51:03,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:03,286 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:03,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1125186427] [2019-12-07 13:51:03,472 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:51:03,472 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:51:03,472 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:51:03,473 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:51:03,473 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:51:03,657 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:51:03,669 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:51:04,027 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:51:04,406 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 97 [2019-12-07 13:51:04,670 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-12-07 13:51:04,982 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-07 13:51:05,333 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-07 13:51:05,636 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-07 13:51:07,311 WARN L192 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-12-07 13:51:07,972 WARN L192 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 133 [2019-12-07 13:51:08,245 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-12-07 13:51:08,541 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-07 13:51:08,896 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2019-12-07 13:51:09,142 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-12-07 13:51:09,144 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:51:09,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:51:09,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2019-12-07 13:51:09,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109095026] [2019-12-07 13:51:09,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 13:51:09,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:51:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 13:51:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1625, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 13:51:09,145 INFO L87 Difference]: Start difference. First operand 571 states and 673 transitions. Second operand 31 states. [2019-12-07 13:51:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:09,787 INFO L93 Difference]: Finished difference Result 817 states and 948 transitions. [2019-12-07 13:51:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 13:51:09,787 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-12-07 13:51:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:09,790 INFO L225 Difference]: With dead ends: 817 [2019-12-07 13:51:09,790 INFO L226 Difference]: Without dead ends: 817 [2019-12-07 13:51:09,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=460, Invalid=2620, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 13:51:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-12-07 13:51:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 665. [2019-12-07 13:51:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-12-07 13:51:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 783 transitions. [2019-12-07 13:51:09,799 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 783 transitions. Word has length 39 [2019-12-07 13:51:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:09,799 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 783 transitions. [2019-12-07 13:51:09,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 13:51:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 783 transitions. [2019-12-07 13:51:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:51:09,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:09,800 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:10,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:10,001 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1736802840, now seen corresponding path program 9 times [2019-12-07 13:51:10,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:51:10,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900168443] [2019-12-07 13:51:10,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:10,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900168443] [2019-12-07 13:51:10,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519223507] [2019-12-07 13:51:10,208 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:10,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 13:51:10,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:51:10,258 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 13:51:10,259 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:10,538 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:10,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581867883] [2019-12-07 13:51:10,915 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:51:10,915 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:51:10,915 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:51:10,915 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:51:10,915 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:51:11,091 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:51:11,108 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:51:11,300 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:51:11,521 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-12-07 13:51:11,738 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:51:12,696 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-12-07 13:51:13,002 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-12-07 13:51:13,283 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-07 13:51:13,631 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-07 13:51:14,124 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-12-07 13:51:14,618 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-12-07 13:51:14,620 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:51:14,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:51:14,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 47 [2019-12-07 13:51:14,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764863881] [2019-12-07 13:51:14,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 13:51:14,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:51:14,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 13:51:14,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=3316, Unknown=0, NotChecked=0, Total=3660 [2019-12-07 13:51:14,622 INFO L87 Difference]: Start difference. First operand 665 states and 783 transitions. Second operand 49 states. [2019-12-07 13:51:17,387 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-12-07 13:51:18,211 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-12-07 13:51:18,507 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 13:51:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:19,589 INFO L93 Difference]: Finished difference Result 800 states and 921 transitions. [2019-12-07 13:51:19,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 13:51:19,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 39 [2019-12-07 13:51:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:19,592 INFO L225 Difference]: With dead ends: 800 [2019-12-07 13:51:19,592 INFO L226 Difference]: Without dead ends: 800 [2019-12-07 13:51:19,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1126, Invalid=6184, Unknown=0, NotChecked=0, Total=7310 [2019-12-07 13:51:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-07 13:51:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 701. [2019-12-07 13:51:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-12-07 13:51:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 827 transitions. [2019-12-07 13:51:19,601 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 827 transitions. Word has length 39 [2019-12-07 13:51:19,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:19,601 INFO L462 AbstractCegarLoop]: Abstraction has 701 states and 827 transitions. [2019-12-07 13:51:19,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 13:51:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 827 transitions. [2019-12-07 13:51:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 13:51:19,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:19,602 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:19,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:19,803 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:19,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:19,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1152497941, now seen corresponding path program 10 times [2019-12-07 13:51:19,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:51:19,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292443152] [2019-12-07 13:51:19,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:20,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292443152] [2019-12-07 13:51:20,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363739616] [2019-12-07 13:51:20,010 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:20,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 77 conjunts are in the unsatisfiable core [2019-12-07 13:51:20,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:20,236 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:20,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683305974] [2019-12-07 13:51:20,382 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:51:20,383 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:51:20,383 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:51:20,383 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:51:20,383 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:51:20,582 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:51:20,593 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 13:51:20,767 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 13:51:20,997 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-12-07 13:51:21,208 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-12-07 13:51:22,396 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-12-07 13:51:22,799 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2019-12-07 13:51:23,014 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-12-07 13:51:23,377 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-12-07 13:51:23,636 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-12-07 13:51:23,888 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-12-07 13:51:23,890 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 13:51:23,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 13:51:23,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 35 [2019-12-07 13:51:23,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390456019] [2019-12-07 13:51:23,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 13:51:23,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:51:23,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 13:51:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1998, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 13:51:23,891 INFO L87 Difference]: Start difference. First operand 701 states and 827 transitions. Second operand 35 states. [2019-12-07 13:51:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:27,676 INFO L93 Difference]: Finished difference Result 1077 states and 1242 transitions. [2019-12-07 13:51:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 13:51:27,676 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2019-12-07 13:51:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:27,679 INFO L225 Difference]: With dead ends: 1077 [2019-12-07 13:51:27,679 INFO L226 Difference]: Without dead ends: 923 [2019-12-07 13:51:27,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=589, Invalid=5417, Unknown=0, NotChecked=0, Total=6006 [2019-12-07 13:51:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-07 13:51:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 845. [2019-12-07 13:51:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-07 13:51:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 998 transitions. [2019-12-07 13:51:27,690 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 998 transitions. Word has length 43 [2019-12-07 13:51:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:27,690 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 998 transitions. [2019-12-07 13:51:27,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 13:51:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 998 transitions. [2019-12-07 13:51:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:51:27,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:27,691 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:27,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:27,892 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:27,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2031786778, now seen corresponding path program 8 times [2019-12-07 13:51:27,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:51:27,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159346862] [2019-12-07 13:51:27,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:51:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 10 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:28,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159346862] [2019-12-07 13:51:28,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328526290] [2019-12-07 13:51:28,171 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:28,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 13:51:28,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 13:51:28,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 100 conjunts are in the unsatisfiable core [2019-12-07 13:51:28,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:51:29,411 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:30,663 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 13:51:30,731 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@74943956 [2019-12-07 13:51:30,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1826481502] [2019-12-07 13:51:30,732 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-12-07 13:51:30,732 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 13:51:30,732 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 13:51:30,732 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 13:51:30,733 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 13:51:30,736 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@74943956 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 13:51:30,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 13:51:30,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-12-07 13:51:30,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292163174] [2019-12-07 13:51:30,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 13:51:30,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:51:30,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 13:51:30,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2031, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 13:51:30,739 INFO L87 Difference]: Start difference. First operand 845 states and 998 transitions. Second operand 19 states. [2019-12-07 13:51:30,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 13:51:30,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:51:30,940 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@74943956 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 13:51:30,942 INFO L168 Benchmark]: Toolchain (without parser) took 128747.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:30,942 INFO L168 Benchmark]: CDTParser took 0.13 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 13:51:30,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 933.3 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:30,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.02 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:30,942 INFO L168 Benchmark]: Boogie Preprocessor took 20.19 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 13:51:30,942 INFO L168 Benchmark]: RCFGBuilder took 299.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:30,943 INFO L168 Benchmark]: TraceAbstraction took 128098.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.6 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:51:30,943 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 933.3 MB in the beginning and 1.1 GB in the end (delta: -184.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.02 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.19 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 299.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 128098.83 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.6 MB). Peak memory consumption was 69.1 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@74943956 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@74943956: 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 13:51:32,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:51:32,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:51:32,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:51:32,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:51:32,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:51:32,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:51:32,304 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:51:32,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:51:32,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:51:32,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:51:32,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:51:32,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:51:32,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:51:32,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:51:32,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:51:32,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:51:32,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:51:32,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:51:32,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:51:32,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:51:32,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:51:32,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:51:32,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:51:32,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:51:32,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:51:32,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:51:32,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:51:32,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:51:32,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:51:32,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:51:32,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:51:32,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:51:32,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:51:32,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:51:32,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:51:32,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:51:32,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:51:32,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:51:32,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:51:32,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:51:32,327 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 13:51:32,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:51:32,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:51:32,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:51:32,338 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:51:32,338 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:51:32,338 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:51:32,339 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:51:32,339 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:51:32,339 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:51:32,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:51:32,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:51:32,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:51:32,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:51:32,340 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 13:51:32,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:51:32,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:51:32,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:51:32,341 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 13:51:32,341 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 13:51:32,341 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 13:51:32,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:51:32,341 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:51:32,341 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 13:51:32,342 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 13:51:32,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:51:32,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:51:32,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:51:32,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:51:32,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:51:32,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:51:32,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:51:32,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:51:32,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:51:32,343 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 13:51:32,343 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 13:51:32,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:51:32,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:51:32,344 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_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 -> f4732dd3bead498dcfa33caf242cd74b12e0ffa3 [2019-12-07 13:51:32,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:51:32,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:51:32,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:51:32,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:51:32,524 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:51:32,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2019-12-07 13:51:32,562 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data/4fd0e26c5/875867cef5874c25bde7b58c0384fa5e/FLAG0eea53b2c [2019-12-07 13:51:33,055 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:51:33,055 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca-2.i [2019-12-07 13:51:33,065 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data/4fd0e26c5/875867cef5874c25bde7b58c0384fa5e/FLAG0eea53b2c [2019-12-07 13:51:33,074 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/data/4fd0e26c5/875867cef5874c25bde7b58c0384fa5e [2019-12-07 13:51:33,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:51:33,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:51:33,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:51:33,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:51:33,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:51:33,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b62f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33, skipping insertion in model container [2019-12-07 13:51:33,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:51:33,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:51:33,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:51:33,344 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:51:33,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:51:33,416 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:51:33,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33 WrapperNode [2019-12-07 13:51:33,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:51:33,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:51:33,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:51:33,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:51:33,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:51:33,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:51:33,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:51:33,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:51:33,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... [2019-12-07 13:51:33,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:51:33,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:51:33,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:51:33,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:51:33,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 13:51:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:51:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2019-12-07 13:51:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:51:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:51:33,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:51:33,786 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:51:33,786 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 13:51:33,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:33 BoogieIcfgContainer [2019-12-07 13:51:33,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:51:33,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:51:33,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:51:33,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:51:33,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:51:33" (1/3) ... [2019-12-07 13:51:33,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76acca48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:51:33, skipping insertion in model container [2019-12-07 13:51:33,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:51:33" (2/3) ... [2019-12-07 13:51:33,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76acca48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:51:33, skipping insertion in model container [2019-12-07 13:51:33,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:33" (3/3) ... [2019-12-07 13:51:33,792 INFO L109 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-2.i [2019-12-07 13:51:33,798 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:51:33,802 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-12-07 13:51:33,809 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-12-07 13:51:33,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:51:33,821 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 13:51:33,821 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:51:33,821 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:51:33,821 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:51:33,821 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:51:33,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:51:33,821 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:51:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-12-07 13:51:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:51:33,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:33,836 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:33,836 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1805029096, now seen corresponding path program 1 times [2019-12-07 13:51:33,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:33,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697451211] [2019-12-07 13:51:33,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:33,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:51:33,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:33,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 13:51:33,930 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:33,953 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 13:51:33,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697451211] [2019-12-07 13:51:33,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:33,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:51:33,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750032429] [2019-12-07 13:51:33,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:51:33,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:33,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:51:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:51:33,969 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 6 states. [2019-12-07 13:51:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:34,068 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-12-07 13:51:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:51:34,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 13:51:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:34,076 INFO L225 Difference]: With dead ends: 76 [2019-12-07 13:51:34,076 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 13:51:34,077 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 13:51:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 13:51:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2019-12-07 13:51:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 13:51:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-12-07 13:51:34,101 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 7 [2019-12-07 13:51:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:34,101 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-12-07 13:51:34,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:51:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-12-07 13:51:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:51:34,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:34,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:34,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 13:51:34,303 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876138, now seen corresponding path program 1 times [2019-12-07 13:51:34,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:34,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652296248] [2019-12-07 13:51:34,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:34,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 13:51:34,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:34,427 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 13:51:34,428 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 13:51:34,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:34,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:34,437 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 13:51:34,437 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-12-07 13:51:34,452 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 13:51:34,452 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:34,462 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 13:51:34,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652296248] [2019-12-07 13:51:34,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:34,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 13:51:34,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262806983] [2019-12-07 13:51:34,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:51:34,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:34,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:51:34,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:51:34,465 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2019-12-07 13:51:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:34,527 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2019-12-07 13:51:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:51:34,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 13:51:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:34,528 INFO L225 Difference]: With dead ends: 41 [2019-12-07 13:51:34,529 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 13:51:34,529 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 13:51:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 13:51:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 13:51:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 13:51:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-12-07 13:51:34,533 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 7 [2019-12-07 13:51:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:34,533 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-12-07 13:51:34,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:51:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-12-07 13:51:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:51:34,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:34,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:34,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 13:51:34,735 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:34,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2019-12-07 13:51:34,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:34,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596308246] [2019-12-07 13:51:34,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:34,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 13:51:34,809 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:34,819 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_18|], 1=[|v_#valid_27|]} [2019-12-07 13:51:34,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:34,826 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 13:51:34,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:34,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:34,852 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 13:51:34,852 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:34,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:34,875 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 13:51:34,875 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:28, output treesize:13 [2019-12-07 13:51:34,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 13:51:34,891 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:34,981 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 13:51:34,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 13:51:34,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:34,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:34,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:51:34,997 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:35,004 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:35,004 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 13:51:35,005 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2019-12-07 13:51:35,020 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 13:51:35,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596308246] [2019-12-07 13:51:35,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:35,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 13:51:35,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085384043] [2019-12-07 13:51:35,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:51:35,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:35,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:51:35,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:51:35,022 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 6 states. [2019-12-07 13:51:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:35,338 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-12-07 13:51:35,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:51:35,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 13:51:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:35,340 INFO L225 Difference]: With dead ends: 73 [2019-12-07 13:51:35,340 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 13:51:35,341 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 13:51:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 13:51:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2019-12-07 13:51:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 13:51:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-12-07 13:51:35,345 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 7 [2019-12-07 13:51:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:35,345 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-12-07 13:51:35,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:51:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-12-07 13:51:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:51:35,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:35,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:35,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 13:51:35,547 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash -533876960, now seen corresponding path program 1 times [2019-12-07 13:51:35,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:35,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595452649] [2019-12-07 13:51:35,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:35,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:51:35,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:35,635 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_29|]} [2019-12-07 13:51:35,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:35,640 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 13:51:35,641 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:35,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:35,658 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 13:51:35,659 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:35,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:35,671 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 13:51:35,671 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 13:51:35,682 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 13:51:35,682 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:35,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:35,768 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 13:51:35,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:35,776 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:35,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:35,781 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 13:51:35,781 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 13:51:35,781 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2019-12-07 13:51:35,802 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 13:51:35,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595452649] [2019-12-07 13:51:35,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:35,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 13:51:35,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281879912] [2019-12-07 13:51:35,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:51:35,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:35,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:51:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:51:35,804 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 6 states. [2019-12-07 13:51:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:36,106 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2019-12-07 13:51:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:51:36,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 13:51:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:36,109 INFO L225 Difference]: With dead ends: 69 [2019-12-07 13:51:36,109 INFO L226 Difference]: Without dead ends: 69 [2019-12-07 13:51:36,109 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 13:51:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-07 13:51:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-12-07 13:51:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 13:51:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-12-07 13:51:36,113 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 9 [2019-12-07 13:51:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:36,113 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-12-07 13:51:36,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:51:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-12-07 13:51:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:51:36,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:36,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:36,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 13:51:36,316 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash -533876908, now seen corresponding path program 1 times [2019-12-07 13:51:36,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:36,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238212555] [2019-12-07 13:51:36,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:36,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:51:36,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:36,413 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 13:51:36,413 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:36,449 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 13:51:36,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238212555] [2019-12-07 13:51:36,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:36,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 13:51:36,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037527753] [2019-12-07 13:51:36,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:51:36,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:51:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:51:36,452 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 6 states. [2019-12-07 13:51:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:36,554 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2019-12-07 13:51:36,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:51:36,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 13:51:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:36,556 INFO L225 Difference]: With dead ends: 74 [2019-12-07 13:51:36,556 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 13:51:36,557 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 13:51:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 13:51:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2019-12-07 13:51:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 13:51:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-12-07 13:51:36,564 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 9 [2019-12-07 13:51:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:36,564 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-12-07 13:51:36,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:51:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-12-07 13:51:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:51:36,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:36,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:36,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 13:51:36,767 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash -476618606, now seen corresponding path program 1 times [2019-12-07 13:51:36,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:36,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316104653] [2019-12-07 13:51:36,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:36,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 13:51:36,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:36,842 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 13:51:36,842 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 13:51:36,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:36,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:36,847 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 13:51:36,847 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 13:51:36,854 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 13:51:36,854 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:36,858 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 13:51:36,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316104653] [2019-12-07 13:51:36,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:36,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 13:51:36,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419366791] [2019-12-07 13:51:36,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:51:36,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:36,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:51:36,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:51:36,859 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 3 states. [2019-12-07 13:51:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:36,909 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2019-12-07 13:51:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:51:36,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:51:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:36,910 INFO L225 Difference]: With dead ends: 51 [2019-12-07 13:51:36,911 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 13:51:36,911 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 13:51:36,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 13:51:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 13:51:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 13:51:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-12-07 13:51:36,914 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 9 [2019-12-07 13:51:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:36,914 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-12-07 13:51:36,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:51:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-12-07 13:51:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:51:36,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:36,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:37,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 13:51:37,117 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash -476618605, now seen corresponding path program 1 times [2019-12-07 13:51:37,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:37,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402779476] [2019-12-07 13:51:37,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:37,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:51:37,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:37,228 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:37,228 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 13:51:37,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:37,256 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 13:51:37,257 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 13:51:37,257 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:17, output treesize:10 [2019-12-07 13:51:37,284 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 13:51:37,284 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:37,437 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 13:51:37,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402779476] [2019-12-07 13:51:37,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:37,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 13:51:37,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595960735] [2019-12-07 13:51:37,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:51:37,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:37,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:51:37,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:51:37,439 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 8 states. [2019-12-07 13:51:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:37,725 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2019-12-07 13:51:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:51:37,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-12-07 13:51:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:37,727 INFO L225 Difference]: With dead ends: 74 [2019-12-07 13:51:37,727 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 13:51:37,728 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 13:51:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 13:51:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2019-12-07 13:51:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 13:51:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-12-07 13:51:37,732 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 9 [2019-12-07 13:51:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:37,733 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-12-07 13:51:37,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:51:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-12-07 13:51:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:51:37,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:37,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:37,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 13:51:37,935 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash 629683418, now seen corresponding path program 1 times [2019-12-07 13:51:37,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:37,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789500254] [2019-12-07 13:51:37,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:38,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:51:38,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:38,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:38,069 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 13:51:38,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:38,096 INFO L614 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-12-07 13:51:38,097 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 13:51:38,097 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2019-12-07 13:51:38,105 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 13:51:38,106 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:38,200 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 13:51:38,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789500254] [2019-12-07 13:51:38,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:38,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 13:51:38,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391624146] [2019-12-07 13:51:38,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:51:38,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:51:38,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:51:38,201 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 6 states. [2019-12-07 13:51:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:38,404 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-12-07 13:51:38,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:51:38,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 13:51:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:38,406 INFO L225 Difference]: With dead ends: 71 [2019-12-07 13:51:38,406 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 13:51:38,407 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 13:51:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 13:51:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2019-12-07 13:51:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 13:51:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2019-12-07 13:51:38,410 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 10 [2019-12-07 13:51:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:38,410 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-12-07 13:51:38,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:51:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2019-12-07 13:51:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:51:38,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:38,411 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:38,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 13:51:38,613 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2019-12-07 13:51:38,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:38,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710116136] [2019-12-07 13:51:38,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:38,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:51:38,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:38,677 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_28|], 1=[|v_#valid_36|]} [2019-12-07 13:51:38,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:38,682 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 13:51:38,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:38,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:38,704 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 13:51:38,705 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:38,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:38,723 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 13:51:38,723 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 13:51:38,837 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 13:51:38,837 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:39,294 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 13:51:39,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:39,299 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:39,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:39,299 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 13:51:39,300 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 13:51:39,300 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:1 [2019-12-07 13:51:39,300 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 13:51:39,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710116136] [2019-12-07 13:51:39,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1897435650] [2019-12-07 13:51:39,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:39,361 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 13:51:39,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:39,366 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_30|], 1=[|v_#valid_38|]} [2019-12-07 13:51:39,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:39,372 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 13:51:39,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:39,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:39,392 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 13:51:39,393 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:39,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:39,407 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 13:51:39,407 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:16 [2019-12-07 13:51:39,526 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 13:51:39,526 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:39,986 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 13:51:39,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:39,991 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:39,991 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:39,992 INFO L502 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-12-07 13:51:39,992 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 13:51:39,992 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:1 [2019-12-07 13:51:39,993 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 13:51:39,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168088257] [2019-12-07 13:51:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:40,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 13:51:40,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:40,058 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_32|], 1=[|v_#valid_40|]} [2019-12-07 13:51:40,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:51:40,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13:51:40,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:40,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:40,078 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 13:51:40,079 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:40,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:40,091 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 13:51:40,092 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:12 [2019-12-07 13:51:40,257 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 13:51:40,258 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:40,265 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 13:51:40,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:51:40,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 4, 5] total 18 [2019-12-07 13:51:40,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205780482] [2019-12-07 13:51:40,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 13:51:40,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:40,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 13:51:40,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:51:40,267 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 19 states. [2019-12-07 13:51:40,932 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 13:51:41,186 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-12-07 13:51:41,739 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-12-07 13:51:42,239 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2019-12-07 13:51:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:42,586 INFO L93 Difference]: Finished difference Result 188 states and 217 transitions. [2019-12-07 13:51:42,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:51:42,588 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2019-12-07 13:51:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:42,589 INFO L225 Difference]: With dead ends: 188 [2019-12-07 13:51:42,589 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 13:51:42,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-12-07 13:51:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 13:51:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 76. [2019-12-07 13:51:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 13:51:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2019-12-07 13:51:42,594 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 11 [2019-12-07 13:51:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:42,594 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2019-12-07 13:51:42,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 13:51:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2019-12-07 13:51:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:51:42,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:42,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:43,196 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 13:51:43,199 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:43,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1518446013, now seen corresponding path program 1 times [2019-12-07 13:51:43,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:43,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313440152] [2019-12-07 13:51:43,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:43,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 13:51:43,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:43,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 13:51:43,300 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:43,306 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 13:51:43,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313440152] [2019-12-07 13:51:43,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:43,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 13:51:43,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036244713] [2019-12-07 13:51:43,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:51:43,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:51:43,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:51:43,307 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 5 states. [2019-12-07 13:51:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:43,388 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-12-07 13:51:43,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:51:43,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-07 13:51:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:43,391 INFO L225 Difference]: With dead ends: 75 [2019-12-07 13:51:43,391 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 13:51:43,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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 13:51:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 13:51:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 13:51:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 13:51:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2019-12-07 13:51:43,395 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 13 [2019-12-07 13:51:43,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:43,395 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2019-12-07 13:51:43,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:51:43,395 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2019-12-07 13:51:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:51:43,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:43,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:43,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 13:51:43,597 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1518446012, now seen corresponding path program 1 times [2019-12-07 13:51:43,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:43,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183363188] [2019-12-07 13:51:43,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:43,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 13:51:43,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:43,743 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 13:51:43,743 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:43,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:51:43,909 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 13:51:43,909 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 13:51:43,921 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 13:51:43,921 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 13:51:43,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:43,952 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 13:51:43,953 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-12-07 13:51:44,082 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 13:51:44,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183363188] [2019-12-07 13:51:44,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:44,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 13:51:44,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044233657] [2019-12-07 13:51:44,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:51:44,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:44,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:51:44,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:51:44,083 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 12 states. [2019-12-07 13:51:44,904 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-07 13:51:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:44,926 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2019-12-07 13:51:44,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:51:44,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 13:51:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:44,928 INFO L225 Difference]: With dead ends: 108 [2019-12-07 13:51:44,928 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 13:51:44,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 13:51:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 13:51:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 77. [2019-12-07 13:51:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 13:51:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2019-12-07 13:51:44,932 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 13 [2019-12-07 13:51:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:44,932 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2019-12-07 13:51:44,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:51:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2019-12-07 13:51:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:51:44,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:44,933 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:45,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 13:51:45,134 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1862804906, now seen corresponding path program 1 times [2019-12-07 13:51:45,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:45,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593365640] [2019-12-07 13:51:45,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:45,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:51:45,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:45,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:45,186 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 13:51:45,186 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:45,213 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 13:51:45,213 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 13:51:45,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 13:51:45,294 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 13:51:45,294 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:45,670 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 13:51:45,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593365640] [2019-12-07 13:51:45,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28113254] [2019-12-07 13:51:45,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:45,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 13:51:45,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:45,743 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:45,743 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 13:51:45,744 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:45,771 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 13:51:45,771 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 13:51:45,771 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 13:51:45,792 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 13:51:45,792 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:45,799 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 13:51:45,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094474886] [2019-12-07 13:51:45,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:45,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 13:51:45,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:45,852 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:45,852 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 13:51:45,852 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:45,882 INFO L614 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-12-07 13:51:45,883 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 13:51:45,883 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2019-12-07 13:51:45,970 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 13:51:45,970 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:46,680 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 13:51:46,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 13:51:46,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6, 5, 6, 6] total 16 [2019-12-07 13:51:46,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650612239] [2019-12-07 13:51:46,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 13:51:46,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:46,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 13:51:46,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:51:46,682 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 17 states. [2019-12-07 13:51:47,612 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-12-07 13:51:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:48,005 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2019-12-07 13:51:48,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:51:48,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 13:51:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:48,007 INFO L225 Difference]: With dead ends: 120 [2019-12-07 13:51:48,007 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 13:51:48,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-12-07 13:51:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 13:51:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 74. [2019-12-07 13:51:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 13:51:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2019-12-07 13:51:48,010 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 13 [2019-12-07 13:51:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:48,011 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2019-12-07 13:51:48,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 13:51:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2019-12-07 13:51:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:51:48,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:48,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:48,613 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 13:51:48,614 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:48,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1429572955, now seen corresponding path program 1 times [2019-12-07 13:51:48,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:48,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041073850] [2019-12-07 13:51:48,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:48,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:51:48,732 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:48,744 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 13:51:48,744 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 13:51:48,744 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:48,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:48,748 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 13:51:48,748 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 13:51:48,766 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 13:51:48,767 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:48,774 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 13:51:48,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041073850] [2019-12-07 13:51:48,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:48,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 13:51:48,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148004038] [2019-12-07 13:51:48,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:51:48,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:51:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:51:48,775 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 6 states. [2019-12-07 13:51:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:48,881 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-12-07 13:51:48,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:51:48,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 13:51:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:48,882 INFO L225 Difference]: With dead ends: 74 [2019-12-07 13:51:48,882 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 13:51:48,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:51:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 13:51:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-12-07 13:51:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-12-07 13:51:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2019-12-07 13:51:48,884 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 16 [2019-12-07 13:51:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:48,884 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2019-12-07 13:51:48,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:51:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2019-12-07 13:51:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:51:48,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:48,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:49,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 13:51:49,086 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1429572954, now seen corresponding path program 1 times [2019-12-07 13:51:49,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:49,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597418378] [2019-12-07 13:51:49,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:49,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 13:51:49,178 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:49,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:49,194 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 13:51:49,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:49,211 INFO L614 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-12-07 13:51:49,212 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 13:51:49,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2019-12-07 13:51:49,243 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 13:51:49,244 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:49,479 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 13:51:49,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597418378] [2019-12-07 13:51:49,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:49,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 13:51:49,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866949767] [2019-12-07 13:51:49,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:51:49,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:49,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:51:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:51:49,480 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand 12 states. [2019-12-07 13:51:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:51:50,244 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2019-12-07 13:51:50,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:51:50,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-07 13:51:50,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:51:50,246 INFO L225 Difference]: With dead ends: 98 [2019-12-07 13:51:50,246 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 13:51:50,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-07 13:51:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 13:51:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-12-07 13:51:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 13:51:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-12-07 13:51:50,249 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 16 [2019-12-07 13:51:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:51:50,249 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-12-07 13:51:50,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:51:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-12-07 13:51:50,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:51:50,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:51:50,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:51:50,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 13:51:50,451 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:51:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:51:50,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2056472215, now seen corresponding path program 1 times [2019-12-07 13:51:50,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:51:50,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559301914] [2019-12-07 13:51:50,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:51:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:51:50,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 13:51:50,610 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:51:50,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 13:51:50,614 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:51:50,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:51:50,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:51:50,615 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 13:51:52,662 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 13:51:52,662 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:51:56,715 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 13:51:56,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559301914] [2019-12-07 13:51:56,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:51:56,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2019-12-07 13:51:56,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962120685] [2019-12-07 13:51:56,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:51:56,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 13:51:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:51:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=45, Unknown=3, NotChecked=0, Total=72 [2019-12-07 13:51:56,717 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 9 states. [2019-12-07 13:52:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:52:06,855 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2019-12-07 13:52:06,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:52:06,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-07 13:52:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:52:06,856 INFO L225 Difference]: With dead ends: 74 [2019-12-07 13:52:06,856 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 13:52:06,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=29, Invalid=58, Unknown=3, NotChecked=0, Total=90 [2019-12-07 13:52:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 13:52:06,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-07 13:52:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 13:52:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2019-12-07 13:52:06,858 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 20 [2019-12-07 13:52:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:52:06,858 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2019-12-07 13:52:06,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:52:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2019-12-07 13:52:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:52:06,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:52:06,859 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:52:07,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 13:52:07,059 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2019-12-07 13:52:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:52:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash 673920784, now seen corresponding path program 1 times [2019-12-07 13:52:07,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 13:52:07,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712248105] [2019-12-07 13:52:07,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/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 13:52:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:07,143 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 13:52:07,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:07,155 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 13:52:07,155 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:07,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:07,163 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:07,164 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 13:52:07,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-12-07 13:52:07,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:07,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:07,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:07,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-12-07 13:52:07,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 13:52:07,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:07,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:07,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:07,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 13:52:07,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-12-07 13:52:07,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:52:07,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:07,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:52:07,386 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-12-07 13:52:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:52:07,425 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:52:13,913 WARN L192 SmtUtils]: Spent 6.13 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 13:52:13,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:13,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 175 [2019-12-07 13:52:13,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:52:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:52:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:52:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:52:13,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:52:13,953 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 175 treesize of output 169 [2019-12-07 13:52:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:52:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:52:13,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:13,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:52:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:52:14,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712248105] [2019-12-07 13:52:14,018 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@59129827 [2019-12-07 13:52:14,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [832912356] [2019-12-07 13:52:14,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:52:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:14,130 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 13:52:14,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:14,132 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@59129827 [2019-12-07 13:52:14,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270546113] [2019-12-07 13:52:14,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_692bfed9-cb4f-4752-a80c-3cf1009d9ce3/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:52:14,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 13:52:14,174 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:52:14,175 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@59129827 [2019-12-07 13:52:14,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:52:14,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 13:52:14,175 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 13:52:14,175 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:52:14,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:52:14,789 WARN L318 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2019-12-07 13:52:14,789 WARN L318 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2019-12-07 13:52:14,792 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 13:52:14,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:52:14 BoogieIcfgContainer [2019-12-07 13:52:14,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:52:14,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:52:14,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:52:14,793 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:52:14,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:51:33" (3/4) ... [2019-12-07 13:52:14,795 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:52:14,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:52:14,796 INFO L168 Benchmark]: Toolchain (without parser) took 41719.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 947.0 MB in the beginning and 931.1 MB in the end (delta: 15.9 MB). Peak memory consumption was 322.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:52:14,796 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:52:14,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:52:14,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.80 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 13:52:14,797 INFO L168 Benchmark]: Boogie Preprocessor took 21.85 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 13:52:14,797 INFO L168 Benchmark]: RCFGBuilder took 316.28 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:52:14,797 INFO L168 Benchmark]: TraceAbstraction took 41004.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 931.1 MB in the end (delta: 146.3 MB). Peak memory consumption was 323.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:52:14,797 INFO L168 Benchmark]: Witness Printer took 2.56 ms. Allocated memory is still 1.3 GB. Free memory is still 931.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:52:14,799 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -164.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.80 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.85 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 316.28 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41004.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 931.1 MB in the end (delta: 146.3 MB). Peak memory consumption was 323.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.56 ms. Allocated memory is still 1.3 GB. Free memory is still 931.1 MB. 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: [L528] int length1 = __VERIFIER_nondet_int(); [L529] int length2 = __VERIFIER_nondet_int(); [L530] COND TRUE length1 < 1 [L531] length1 = 1 [L533] COND TRUE length2 < 1 [L534] length2 = 1 [L536] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); [L537] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); [L539] int i = 0; [L539] COND FALSE !(i< length1 -1) [L544] int i = 0; [L544] COND FALSE !(i< length2 -1) [L549] nondetString1[length1-1] = '\0' [L550] nondetString2[length2-1] = '\0' [L516] const char *p, *spanp; [L517] char c, sc; [L518] p = s1 [L519] EXPR p++ [L519] c = *p++ [L520] spanp = s2 [L522] EXPR spanp++ [L522] EXPR sc = *spanp++ [L522] COND FALSE !((sc = *spanp++) == c) [L524] COND FALSE !(sc != 0) [L519] p++ - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 13 error locations. Result: UNKNOWN, OverallTime: 40.9s, OverallIterations: 16, TraceHistogramMax: 2, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 441 SDtfs, 2407 SDslu, 976 SDs, 0 SdLazy, 888 SolverSat, 91 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 289 SyntacticMatches, 12 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=11, 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, 15 MinimizatonAttempts, 360 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 396 ConstructedInterpolants, 12 QuantifiedInterpolants, 47448 SizeOfPredicates, 120 NumberOfNonLiveVariables, 786 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 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...