./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:58:15,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:58:15,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:58:15,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:58:15,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:58:15,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:58:15,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:58:15,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:58:15,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:58:15,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:58:15,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:58:15,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:58:15,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:58:15,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:58:15,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:58:15,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:58:15,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:58:15,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:58:15,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:58:15,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:58:15,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:58:15,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:58:15,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:58:15,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:58:15,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:58:15,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:58:15,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:58:15,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:58:15,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:58:15,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:58:15,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:58:15,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:58:15,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:58:15,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:58:15,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:58:15,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:58:15,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:58:15,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:58:15,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:58:15,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:58:15,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:58:15,667 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-12-07 15:58:15,679 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:58:15,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:58:15,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:58:15,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:58:15,680 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:58:15,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:58:15,680 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:58:15,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:58:15,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:58:15,681 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 15:58:15,681 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 15:58:15,681 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 15:58:15,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:58:15,681 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:58:15,681 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:58:15,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:58:15,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:58:15,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:58:15,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:58:15,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:58:15,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:58:15,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:58:15,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:58:15,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:58:15,683 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:58:15,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-12-07 15:58:15,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:58:15,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:58:15,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:58:15,807 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:58:15,808 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:58:15,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-12-07 15:58:15,850 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/data/6c36e49da/dbc560cf651c44f8bd3618470c5f9900/FLAGf4de8d66a [2019-12-07 15:58:16,254 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:58:16,255 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-12-07 15:58:16,258 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/data/6c36e49da/dbc560cf651c44f8bd3618470c5f9900/FLAGf4de8d66a [2019-12-07 15:58:16,639 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/data/6c36e49da/dbc560cf651c44f8bd3618470c5f9900 [2019-12-07 15:58:16,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:58:16,643 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 15:58:16,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:58:16,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:58:16,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:58:16,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28de8c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16, skipping insertion in model container [2019-12-07 15:58:16,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:58:16,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:58:16,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:58:16,772 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:58:16,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:58:16,828 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:58:16,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16 WrapperNode [2019-12-07 15:58:16,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:58:16,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:58:16,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:58:16,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:58:16,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (1/1) ... [2019-12-07 15:58:16,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:58:16,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:58:16,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:58:16,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:58:16,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:16,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 15:58:16,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:58:16,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 15:58:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 15:58:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:58:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:58:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 15:58:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:58:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 15:58:16,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:58:17,119 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:58:17,120 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 15:58:17,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:58:17 BoogieIcfgContainer [2019-12-07 15:58:17,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:58:17,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:58:17,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:58:17,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:58:17,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:58:16" (1/3) ... [2019-12-07 15:58:17,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1184e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:58:17, skipping insertion in model container [2019-12-07 15:58:17,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:58:16" (2/3) ... [2019-12-07 15:58:17,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1184e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:58:17, skipping insertion in model container [2019-12-07 15:58:17,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:58:17" (3/3) ... [2019-12-07 15:58:17,126 INFO L109 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-12-07 15:58:17,132 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:58:17,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-12-07 15:58:17,144 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-12-07 15:58:17,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:58:17,156 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 15:58:17,156 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:58:17,156 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:58:17,156 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:58:17,156 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:58:17,156 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:58:17,156 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:58:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-12-07 15:58:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:58:17,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:17,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:17,173 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145205, now seen corresponding path program 1 times [2019-12-07 15:58:17,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:17,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820570666] [2019-12-07 15:58:17,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,325 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 15:58:17,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820570666] [2019-12-07 15:58:17,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:17,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:17,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587683449] [2019-12-07 15:58:17,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:17,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:17,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:17,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:17,339 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2019-12-07 15:58:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:17,451 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-12-07 15:58:17,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:17,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 15:58:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:17,458 INFO L225 Difference]: With dead ends: 57 [2019-12-07 15:58:17,459 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 15:58:17,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:58:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 15:58:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-07 15:58:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 15:58:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-12-07 15:58:17,485 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 7 [2019-12-07 15:58:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:17,485 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-12-07 15:58:17,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-12-07 15:58:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:58:17,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:17,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:17,486 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145206, now seen corresponding path program 1 times [2019-12-07 15:58:17,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:17,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545156082] [2019-12-07 15:58:17,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,546 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 15:58:17,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545156082] [2019-12-07 15:58:17,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:17,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:17,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481334074] [2019-12-07 15:58:17,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:17,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:17,549 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2019-12-07 15:58:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:17,617 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-12-07 15:58:17,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:17,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 15:58:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:17,619 INFO L225 Difference]: With dead ends: 50 [2019-12-07 15:58:17,619 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 15:58:17,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:58:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 15:58:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 15:58:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 15:58:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-12-07 15:58:17,624 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 7 [2019-12-07 15:58:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:17,624 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-12-07 15:58:17,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-12-07 15:58:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:58:17,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:17,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:17,625 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash -523138922, now seen corresponding path program 1 times [2019-12-07 15:58:17,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:17,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008596846] [2019-12-07 15:58:17,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,657 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 15:58:17,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008596846] [2019-12-07 15:58:17,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:17,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:17,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366349845] [2019-12-07 15:58:17,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:17,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:17,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:17,658 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2019-12-07 15:58:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:17,716 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-12-07 15:58:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:17,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 15:58:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:17,717 INFO L225 Difference]: With dead ends: 46 [2019-12-07 15:58:17,717 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 15:58:17,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:58:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 15:58:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-07 15:58:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 15:58:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-12-07 15:58:17,721 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 8 [2019-12-07 15:58:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:17,721 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-12-07 15:58:17,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-12-07 15:58:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:58:17,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:17,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:17,722 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash -523138921, now seen corresponding path program 1 times [2019-12-07 15:58:17,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:17,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543122217] [2019-12-07 15:58:17,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,761 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 15:58:17,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543122217] [2019-12-07 15:58:17,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:17,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:17,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035816181] [2019-12-07 15:58:17,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:17,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:17,763 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 4 states. [2019-12-07 15:58:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:17,815 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-12-07 15:58:17,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:17,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 15:58:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:17,816 INFO L225 Difference]: With dead ends: 42 [2019-12-07 15:58:17,816 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 15:58:17,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:58:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 15:58:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-07 15:58:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 15:58:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-12-07 15:58:17,819 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-12-07 15:58:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:17,819 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-12-07 15:58:17,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-12-07 15:58:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 15:58:17,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:17,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:17,820 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:17,820 INFO L82 PathProgramCache]: Analyzing trace with hash 962562584, now seen corresponding path program 1 times [2019-12-07 15:58:17,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:17,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071770798] [2019-12-07 15:58:17,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,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 15:58:17,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071770798] [2019-12-07 15:58:17,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:17,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:17,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701675240] [2019-12-07 15:58:17,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:17,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:17,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:17,855 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-12-07 15:58:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:17,909 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-12-07 15:58:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:17,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 15:58:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:17,910 INFO L225 Difference]: With dead ends: 38 [2019-12-07 15:58:17,910 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 15:58:17,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:58:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 15:58:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 15:58:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 15:58:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-12-07 15:58:17,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2019-12-07 15:58:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:17,914 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-12-07 15:58:17,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-12-07 15:58:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 15:58:17,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:17,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:17,915 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:17,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash 962562585, now seen corresponding path program 1 times [2019-12-07 15:58:17,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:17,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976607808] [2019-12-07 15:58:17,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:17,947 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 15:58:17,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976607808] [2019-12-07 15:58:17,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:17,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:17,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488891632] [2019-12-07 15:58:17,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:17,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:17,949 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2019-12-07 15:58:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:17,997 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-12-07 15:58:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:17,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 15:58:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:17,998 INFO L225 Difference]: With dead ends: 34 [2019-12-07 15:58:17,998 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 15:58:17,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:58:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 15:58:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 15:58:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 15:58:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-12-07 15:58:18,001 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 9 [2019-12-07 15:58:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:18,001 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-12-07 15:58:18,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-12-07 15:58:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:58:18,002 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:18,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:18,002 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:18,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:18,003 INFO L82 PathProgramCache]: Analyzing trace with hash -225330983, now seen corresponding path program 1 times [2019-12-07 15:58:18,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:18,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934297589] [2019-12-07 15:58:18,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,025 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 15:58:18,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934297589] [2019-12-07 15:58:18,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:18,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:18,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779272508] [2019-12-07 15:58:18,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:18,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:18,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:18,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:18,027 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2019-12-07 15:58:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:18,074 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-12-07 15:58:18,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:18,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 15:58:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:18,075 INFO L225 Difference]: With dead ends: 31 [2019-12-07 15:58:18,075 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 15:58:18,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:58:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 15:58:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 15:58:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 15:58:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-12-07 15:58:18,078 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2019-12-07 15:58:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:18,078 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-12-07 15:58:18,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-12-07 15:58:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:58:18,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:18,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:18,079 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash -225330982, now seen corresponding path program 1 times [2019-12-07 15:58:18,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:18,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061167756] [2019-12-07 15:58:18,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,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 15:58:18,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061167756] [2019-12-07 15:58:18,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:18,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:58:18,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434750208] [2019-12-07 15:58:18,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:58:18,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:18,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:58:18,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:58:18,107 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-12-07 15:58:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:18,145 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-12-07 15:58:18,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:58:18,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 15:58:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:18,146 INFO L225 Difference]: With dead ends: 28 [2019-12-07 15:58:18,146 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 15:58:18,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 15:58:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 15:58:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-07 15:58:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 15:58:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-12-07 15:58:18,149 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-12-07 15:58:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:18,149 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-12-07 15:58:18,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:58:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-12-07 15:58:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:58:18,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:18,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:18,150 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1860435007, now seen corresponding path program 1 times [2019-12-07 15:58:18,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:18,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998302520] [2019-12-07 15:58:18,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,185 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 15:58:18,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998302520] [2019-12-07 15:58:18,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:58:18,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:58:18,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817483083] [2019-12-07 15:58:18,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:58:18,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:18,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:58:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:58:18,188 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-12-07 15:58:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:18,249 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-12-07 15:58:18,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:58:18,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 15:58:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:18,250 INFO L225 Difference]: With dead ends: 43 [2019-12-07 15:58:18,250 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 15:58:18,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:58:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 15:58:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-12-07 15:58:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 15:58:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-12-07 15:58:18,253 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2019-12-07 15:58:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:18,253 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-12-07 15:58:18,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:58:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-12-07 15:58:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:58:18,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:18,254 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:18,254 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash 988980839, now seen corresponding path program 1 times [2019-12-07 15:58:18,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:18,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354695888] [2019-12-07 15:58:18,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,357 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 15:58:18,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354695888] [2019-12-07 15:58:18,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910490215] [2019-12-07 15:58:18,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:18,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 15:58:18,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:18,440 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:18,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 15:58:18,441 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:18,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:18,450 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 15:58:18,450 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2019-12-07 15:58:18,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 15:58:18,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:18,460 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:18,461 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:18,461 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-12-07 15:58:18,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 15:58:18,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:18,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:18,473 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:58:18,473 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-12-07 15:58:18,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 15:58:18,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:18,495 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:18,496 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:18,496 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-12-07 15:58:18,498 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 15:58:18,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:58:18,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-12-07 15:58:18,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574687474] [2019-12-07 15:58:18,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:58:18,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:18,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:58:18,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:58:18,504 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2019-12-07 15:58:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:18,623 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-12-07 15:58:18,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:58:18,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-07 15:58:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:18,624 INFO L225 Difference]: With dead ends: 36 [2019-12-07 15:58:18,624 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 15:58:18,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:58:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 15:58:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-12-07 15:58:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 15:58:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-12-07 15:58:18,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2019-12-07 15:58:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:18,627 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-12-07 15:58:18,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:58:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-12-07 15:58:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:58:18,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:18,627 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:18,828 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:58:18,829 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1875845268, now seen corresponding path program 1 times [2019-12-07 15:58:18,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:18,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405956034] [2019-12-07 15:58:18,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:19,117 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 15:58:19,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405956034] [2019-12-07 15:58:19,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530448643] [2019-12-07 15:58:19,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:19,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 15:58:19,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:19,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:19,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 15:58:19,158 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:19,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:19,163 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:19,163 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-12-07 15:58:19,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 15:58:19,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:19,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:19,183 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:19,183 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 15:58:19,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 15:58:19,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:19,208 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:19,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:58:19,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-12-07 15:58:19,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-12-07 15:58:19,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:19,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:19,244 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 15:58:19,245 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-12-07 15:58:19,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 15:58:19,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:19,273 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:19,274 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:19,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-12-07 15:58:19,276 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 15:58:19,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:58:19,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-12-07 15:58:19,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851491611] [2019-12-07 15:58:19,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 15:58:19,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 15:58:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-07 15:58:19,277 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 15 states. [2019-12-07 15:58:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:19,504 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-12-07 15:58:19,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:58:19,504 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-07 15:58:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:19,505 INFO L225 Difference]: With dead ends: 36 [2019-12-07 15:58:19,505 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 15:58:19,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:58:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 15:58:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-12-07 15:58:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 15:58:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-12-07 15:58:19,507 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-12-07 15:58:19,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:19,507 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-12-07 15:58:19,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 15:58:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-12-07 15:58:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:58:19,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:19,508 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:19,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:58:19,709 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash -230868331, now seen corresponding path program 1 times [2019-12-07 15:58:19,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:19,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615638652] [2019-12-07 15:58:19,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:19,983 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 15:58:19,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615638652] [2019-12-07 15:58:19,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031372745] [2019-12-07 15:58:19,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:20,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 15:58:20,015 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:20,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 15:58:20,038 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,044 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:20,044 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,045 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 15:58:20,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:20,070 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 15:58:20,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,086 INFO L614 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-12-07 15:58:20,086 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:58:20,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 15:58:20,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:20,120 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 15:58:20,120 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,134 INFO L614 ElimStorePlain]: treesize reduction 16, result has 56.8 percent of original size [2019-12-07 15:58:20,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:58:20,135 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-12-07 15:58:20,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:20,173 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 15:58:20,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,187 INFO L614 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2019-12-07 15:58:20,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:58:20,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-12-07 15:58:20,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 15:58:20,209 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:20,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 15:58:20,220 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 15:58:20,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:58:20,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-12-07 15:58:20,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002471362] [2019-12-07 15:58:20,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:58:20,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:20,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:58:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-07 15:58:20,222 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-12-07 15:58:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:20,293 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-12-07 15:58:20,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:58:20,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-12-07 15:58:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:20,293 INFO L225 Difference]: With dead ends: 39 [2019-12-07 15:58:20,293 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 15:58:20,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:58:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 15:58:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-12-07 15:58:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 15:58:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-12-07 15:58:20,296 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2019-12-07 15:58:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:20,296 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-12-07 15:58:20,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:58:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-12-07 15:58:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 15:58:20,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:20,297 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:20,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:58:20,499 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:20,500 INFO L82 PathProgramCache]: Analyzing trace with hash -587061395, now seen corresponding path program 1 times [2019-12-07 15:58:20,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:20,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814487080] [2019-12-07 15:58:20,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:58:20,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814487080] [2019-12-07 15:58:20,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014072925] [2019-12-07 15:58:20,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:20,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 15:58:20,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:20,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 15:58:20,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,965 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:20,966 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:20,966 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 15:58:20,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:20,993 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 15:58:20,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:21,009 INFO L614 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-12-07 15:58:21,009 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:58:21,009 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-12-07 15:58:21,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:21,040 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 15:58:21,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:21,055 INFO L614 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-12-07 15:58:21,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:21,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-12-07 15:58:21,091 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:21,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 68 [2019-12-07 15:58:21,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:21,113 INFO L614 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-12-07 15:58:21,113 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:21,113 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:39 [2019-12-07 15:58:21,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:21,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:21,291 INFO L430 ElimStorePlain]: Different costs {3=[v_prenex_2], 5=[|v_#memory_int_42|]} [2019-12-07 15:58:21,311 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:21,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-12-07 15:58:21,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:21,340 INFO L614 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-12-07 15:58:21,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:21,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-12-07 15:58:21,352 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:21,375 INFO L614 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-12-07 15:58:21,375 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 15:58:21,376 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-12-07 15:58:21,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 15:58:21,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:21,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:21,413 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 15:58:21,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-12-07 15:58:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:58:21,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:58:21,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-12-07 15:58:21,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697587536] [2019-12-07 15:58:21,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:58:21,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:21,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:58:21,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:58:21,434 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 24 states. [2019-12-07 15:58:22,623 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 28 [2019-12-07 15:58:22,837 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2019-12-07 15:58:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:23,192 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-12-07 15:58:23,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 15:58:23,193 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-12-07 15:58:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:23,194 INFO L225 Difference]: With dead ends: 65 [2019-12-07 15:58:23,194 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 15:58:23,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=414, Invalid=1566, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 15:58:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 15:58:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-12-07 15:58:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 15:58:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-12-07 15:58:23,200 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-12-07 15:58:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:23,200 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-12-07 15:58:23,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:58:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-12-07 15:58:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:58:23,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:23,201 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:23,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:58:23,403 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 349814, now seen corresponding path program 1 times [2019-12-07 15:58:23,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:23,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196125469] [2019-12-07 15:58:23,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:58:23,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196125469] [2019-12-07 15:58:23,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498513186] [2019-12-07 15:58:23,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:23,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:58:23,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:23,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 15:58:23,541 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:23,548 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:23,548 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:23,548 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 15:58:23,567 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:23,567 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 15:58:23,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:23,580 INFO L614 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-12-07 15:58:23,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:23,581 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:25 [2019-12-07 15:58:23,634 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 15:58:23,634 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:23,639 INFO L614 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-12-07 15:58:23,639 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:23,639 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2019-12-07 15:58:23,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 15:58:23,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:23,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:23,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:23,653 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 15:58:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:58:23,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:58:23,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 15:58:23,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898599036] [2019-12-07 15:58:23,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 15:58:23,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 15:58:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:58:23,665 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 16 states. [2019-12-07 15:58:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:23,932 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-12-07 15:58:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:58:23,932 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-12-07 15:58:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:23,933 INFO L225 Difference]: With dead ends: 57 [2019-12-07 15:58:23,933 INFO L226 Difference]: Without dead ends: 57 [2019-12-07 15:58:23,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:58:23,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-07 15:58:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-12-07 15:58:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 15:58:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-12-07 15:58:23,936 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 34 [2019-12-07 15:58:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:23,936 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-12-07 15:58:23,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 15:58:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-12-07 15:58:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 15:58:23,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:23,937 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:24,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:58:24,138 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:24,139 INFO L82 PathProgramCache]: Analyzing trace with hash 210942700, now seen corresponding path program 1 times [2019-12-07 15:58:24,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:24,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56153465] [2019-12-07 15:58:24,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 15:58:24,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56153465] [2019-12-07 15:58:24,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654260836] [2019-12-07 15:58:24,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:24,369 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 15:58:24,371 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:24,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 15:58:24,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-07 15:58:24,415 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,415 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 15:58:24,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,432 INFO L614 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2019-12-07 15:58:24,432 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,432 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-12-07 15:58:24,467 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 68 [2019-12-07 15:58:24,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,493 INFO L614 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-12-07 15:58:24,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,493 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2019-12-07 15:58:24,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-12-07 15:58:24,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,556 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-12-07 15:58:24,556 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 15:58:24,562 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,590 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-12-07 15:58:24,590 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,665 INFO L614 ElimStorePlain]: treesize reduction 167, result has 16.9 percent of original size [2019-12-07 15:58:24,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,666 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:165, output treesize:34 [2019-12-07 15:58:24,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 110 [2019-12-07 15:58:24,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,753 INFO L614 ElimStorePlain]: treesize reduction 36, result has 59.6 percent of original size [2019-12-07 15:58:24,753 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,754 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:53 [2019-12-07 15:58:24,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:24,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-12-07 15:58:24,805 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-12-07 15:58:24,811 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-12-07 15:58:24,829 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,847 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-12-07 15:58:24,847 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-12-07 15:58:24,882 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-12-07 15:58:24,918 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:24,977 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:24,978 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 137 [2019-12-07 15:58:24,979 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:25,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:25,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-12-07 15:58:25,009 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:25,235 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-12-07 15:58:25,235 INFO L614 ElimStorePlain]: treesize reduction 340, result has 34.7 percent of original size [2019-12-07 15:58:25,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 15:58:25,236 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:369, output treesize:181 [2019-12-07 15:58:25,429 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 15:58:25,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 15:58:25,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:25,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:25,728 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-12-07 15:58:25,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:58:25,836 INFO L430 ElimStorePlain]: Different costs {9=[|v_#memory_int_52|, v_prenex_5], 11=[v_prenex_7]} [2019-12-07 15:58:25,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:25,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-12-07 15:58:25,861 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:25,938 INFO L614 ElimStorePlain]: treesize reduction 32, result has 78.7 percent of original size [2019-12-07 15:58:25,964 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:25,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-12-07 15:58:25,965 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:26,038 INFO L614 ElimStorePlain]: treesize reduction 32, result has 78.2 percent of original size [2019-12-07 15:58:26,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:26,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-12-07 15:58:26,066 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:26,132 INFO L614 ElimStorePlain]: treesize reduction 32, result has 77.8 percent of original size [2019-12-07 15:58:26,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-12-07 15:58:26,134 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:121, output treesize:112 [2019-12-07 15:58:26,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:26,275 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_int_53|], 9=[v_prenex_8]} [2019-12-07 15:58:26,307 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:26,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-12-07 15:58:26,308 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:26,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 15:58:26,314 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:26,368 INFO L614 ElimStorePlain]: treesize reduction 69, result has 58.2 percent of original size [2019-12-07 15:58:26,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:26,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-12-07 15:58:26,398 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:26,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 15:58:26,402 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:26,428 INFO L614 ElimStorePlain]: treesize reduction 69, result has 39.5 percent of original size [2019-12-07 15:58:26,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 15:58:26,429 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:147, output treesize:45 [2019-12-07 15:58:26,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 15:58:26,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:26,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:26,470 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 15:58:26,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-12-07 15:58:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:58:26,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:58:26,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2019-12-07 15:58:26,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512032314] [2019-12-07 15:58:26,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 15:58:26,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 15:58:26,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-07 15:58:26,489 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 21 states. [2019-12-07 15:58:27,039 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-07 15:58:27,317 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-07 15:58:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:27,605 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-12-07 15:58:27,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 15:58:27,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-12-07 15:58:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:27,606 INFO L225 Difference]: With dead ends: 88 [2019-12-07 15:58:27,606 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 15:58:27,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2019-12-07 15:58:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 15:58:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2019-12-07 15:58:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 15:58:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-12-07 15:58:27,609 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 44 [2019-12-07 15:58:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:27,609 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-12-07 15:58:27,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 15:58:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-12-07 15:58:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:58:27,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:27,611 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:27,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:58:27,811 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash 264149196, now seen corresponding path program 1 times [2019-12-07 15:58:27,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:27,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61452077] [2019-12-07 15:58:27,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 15:58:27,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61452077] [2019-12-07 15:58:27,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226465699] [2019-12-07 15:58:27,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:27,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 15:58:27,951 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:27,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:27,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 15:58:27,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:27,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:27,965 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 15:58:27,965 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:11 [2019-12-07 15:58:27,978 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 15:58:27,978 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:27,983 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:27,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:27,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 15:58:27,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2019-12-07 15:58:27,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:28,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:14 [2019-12-07 15:58:28,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 15:58:28,020 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:28,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,026 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 15:58:28,052 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:28,052 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 15:58:28,052 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,068 INFO L614 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2019-12-07 15:58:28,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,068 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-12-07 15:58:28,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:28,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 15:58:28,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:28,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-12-07 15:58:28,123 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,167 INFO L614 ElimStorePlain]: treesize reduction 20, result has 77.5 percent of original size [2019-12-07 15:58:28,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:28,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-12-07 15:58:28,168 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:69 [2019-12-07 15:58:28,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:28,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:58:28,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:58:28,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 15:58:28,276 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:28,281 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:58:28,281 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-12-07 15:58:28,300 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 15:58:28,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:58:28,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:58:28,303 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-12-07 15:58:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 15:58:28,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:58:28,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-12-07 15:58:28,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999375513] [2019-12-07 15:58:28,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 15:58:28,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 15:58:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-07 15:58:28,324 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 19 states. [2019-12-07 15:58:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:29,118 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-12-07 15:58:29,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 15:58:29,118 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-07 15:58:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:29,119 INFO L225 Difference]: With dead ends: 91 [2019-12-07 15:58:29,119 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 15:58:29,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 15:58:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 15:58:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2019-12-07 15:58:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 15:58:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-12-07 15:58:29,126 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 55 [2019-12-07 15:58:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:29,127 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-12-07 15:58:29,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 15:58:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-12-07 15:58:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 15:58:29,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:58:29,129 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:58:29,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:58:29,330 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-12-07 15:58:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:58:29,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2053442217, now seen corresponding path program 2 times [2019-12-07 15:58:29,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:58:29,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297728448] [2019-12-07 15:58:29,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:58:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:29,694 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-12-07 15:58:29,819 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-12-07 15:58:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:58:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 102 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 15:58:30,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297728448] [2019-12-07 15:58:30,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183403044] [2019-12-07 15:58:30,375 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/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 15:58:30,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 15:58:30,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:58:30,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 15:58:30,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:58:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-12-07 15:58:30,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:58:30,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2019-12-07 15:58:30,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886460085] [2019-12-07 15:58:30,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:58:30,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:58:30,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:58:30,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:58:30,526 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2019-12-07 15:58:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:58:30,570 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-12-07 15:58:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:58:30,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-07 15:58:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:58:30,571 INFO L225 Difference]: With dead ends: 75 [2019-12-07 15:58:30,571 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:58:30,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:58:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:58:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:58:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:58:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:58:30,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2019-12-07 15:58:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:58:30,572 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:58:30,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:58:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:58:30,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:58:30,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:58:30,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:58:30 BoogieIcfgContainer [2019-12-07 15:58:30,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:58:30,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:58:30,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:58:30,784 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:58:30,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:58:17" (3/4) ... [2019-12-07 15:58:30,792 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:58:30,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 15:58:30,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 15:58:30,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 15:58:30,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 15:58:30,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 15:58:30,816 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 15:58:30,849 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6a0497bb-9277-4f6c-8c4f-d0fa0249deee/bin/uautomizer/witness.graphml [2019-12-07 15:58:30,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:58:30,850 INFO L168 Benchmark]: Toolchain (without parser) took 14208.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.0 MB). Free memory was 939.4 MB in the beginning and 877.0 MB in the end (delta: 62.4 MB). Peak memory consumption was 300.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:30,850 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:58:30,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:30,851 INFO L168 Benchmark]: Boogie Preprocessor took 23.73 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:30,851 INFO L168 Benchmark]: RCFGBuilder took 268.20 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:30,851 INFO L168 Benchmark]: TraceAbstraction took 13661.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.8 MB). Free memory was 1.1 GB in the beginning and 887.5 MB in the end (delta: 202.9 MB). Peak memory consumption was 316.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:30,851 INFO L168 Benchmark]: Witness Printer took 65.94 ms. Allocated memory is still 1.3 GB. Free memory was 887.5 MB in the beginning and 877.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:58:30,853 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.73 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 268.20 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: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13661.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.8 MB). Free memory was 1.1 GB in the beginning and 887.5 MB in the end (delta: 202.9 MB). Peak memory consumption was 316.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.94 ms. Allocated memory is still 1.3 GB. Free memory was 887.5 MB in the beginning and 877.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 61 locations, 31 error locations. Result: SAFE, OverallTime: 13.6s, OverallIterations: 17, TraceHistogramMax: 9, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 286 SDtfs, 971 SDslu, 832 SDs, 0 SdLazy, 2345 SolverSat, 565 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 510 GetRequests, 289 SyntacticMatches, 12 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 106 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 686 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 661 ConstructedInterpolants, 23 QuantifiedInterpolants, 895755 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1348 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 417/560 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 proved your program to be correct! Received shutdown request...