./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/prefixsum_iter.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 32bit --witnessprinter.graph.data.programhash 3f80b8c4eb15aaab54b9ff42df2afd9ba8d11db1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-21 21:58:05,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 21:58:05,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 21:58:05,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 21:58:05,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 21:58:05,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 21:58:05,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 21:58:05,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 21:58:05,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 21:58:05,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 21:58:05,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 21:58:05,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 21:58:05,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 21:58:05,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 21:58:05,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 21:58:05,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 21:58:05,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 21:58:05,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 21:58:05,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 21:58:05,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 21:58:05,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 21:58:05,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 21:58:05,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 21:58:05,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 21:58:05,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 21:58:05,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 21:58:05,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 21:58:05,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 21:58:05,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 21:58:05,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 21:58:05,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 21:58:05,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 21:58:05,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 21:58:05,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 21:58:05,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 21:58:05,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 21:58:05,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 21:58:05,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 21:58:05,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 21:58:05,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 21:58:05,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 21:58:05,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 21:58:05,772 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 21:58:05,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 21:58:05,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 21:58:05,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 21:58:05,774 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 21:58:05,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 21:58:05,775 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 21:58:05,775 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 21:58:05,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 21:58:05,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 21:58:05,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 21:58:05,776 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 21:58:05,776 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 21:58:05,776 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 21:58:05,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 21:58:05,777 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-21 21:58:05,777 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 21:58:05,777 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 21:58:05,777 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 21:58:05,777 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 21:58:05,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 21:58:05,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 21:58:05,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 21:58:05,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 21:58:05,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 21:58:05,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 21:58:05,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 21:58:05,779 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 21:58:05,780 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 21:58:05,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 21:58:05,780 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f80b8c4eb15aaab54b9ff42df2afd9ba8d11db1 [2019-11-21 21:58:06,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 21:58:06,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 21:58:06,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 21:58:06,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 21:58:06,126 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 21:58:06,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2019-11-21 21:58:06,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0bda5d8/bfb70f91ed7f4713977b9bed21347588/FLAGeaa865f3c [2019-11-21 21:58:06,634 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 21:58:06,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2019-11-21 21:58:06,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0bda5d8/bfb70f91ed7f4713977b9bed21347588/FLAGeaa865f3c [2019-11-21 21:58:07,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0bda5d8/bfb70f91ed7f4713977b9bed21347588 [2019-11-21 21:58:07,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 21:58:07,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 21:58:07,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 21:58:07,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 21:58:07,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 21:58:07,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23fdf673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07, skipping insertion in model container [2019-11-21 21:58:07,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 21:58:07,060 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 21:58:07,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:58:07,295 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 21:58:07,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:58:07,416 INFO L205 MainTranslator]: Completed translation [2019-11-21 21:58:07,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07 WrapperNode [2019-11-21 21:58:07,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 21:58:07,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 21:58:07,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 21:58:07,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 21:58:07,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (1/1) ... [2019-11-21 21:58:07,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 21:58:07,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 21:58:07,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 21:58:07,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 21:58:07,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-21 21:58:07,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 21:58:07,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 21:58:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-21 21:58:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2019-11-21 21:58:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2019-11-21 21:58:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2019-11-21 21:58:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-21 21:58:07,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 21:58:07,530 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 21:58:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 21:58:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 21:58:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 21:58:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-21 21:58:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 21:58:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-21 21:58:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2019-11-21 21:58:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 21:58:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 21:58:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2019-11-21 21:58:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2019-11-21 21:58:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-21 21:58:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 21:58:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 21:58:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 21:58:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 21:58:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 21:58:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 21:58:08,319 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 21:58:08,320 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-21 21:58:08,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:58:08 BoogieIcfgContainer [2019-11-21 21:58:08,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 21:58:08,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 21:58:08,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 21:58:08,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 21:58:08,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:58:07" (1/3) ... [2019-11-21 21:58:08,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310bde3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:58:08, skipping insertion in model container [2019-11-21 21:58:08,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:58:07" (2/3) ... [2019-11-21 21:58:08,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310bde3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:58:08, skipping insertion in model container [2019-11-21 21:58:08,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:58:08" (3/3) ... [2019-11-21 21:58:08,330 INFO L109 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2019-11-21 21:58:08,339 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 21:58:08,347 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-11-21 21:58:08,359 INFO L249 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-11-21 21:58:08,380 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 21:58:08,380 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 21:58:08,380 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 21:58:08,380 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 21:58:08,380 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 21:58:08,381 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 21:58:08,381 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 21:58:08,381 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 21:58:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-21 21:58:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-21 21:58:08,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:58:08,412 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:58:08,413 INFO L410 AbstractCegarLoop]: === Iteration 1 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:58:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:58:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash -993650764, now seen corresponding path program 1 times [2019-11-21 21:58:08,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:58:08,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1803562230] [2019-11-21 21:58:08,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:58:08,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:58:08,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:58:08,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 21:58:08,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:08,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:08,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:08,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:58:08,752 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:08,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-21 21:58:08,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:08,780 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 21:58:08,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 21:58:08,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 21:58:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:58:08,884 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:58:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:58:08,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1803562230] [2019-11-21 21:58:08,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:58:08,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 7 [2019-11-21 21:58:08,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652979008] [2019-11-21 21:58:08,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 21:58:08,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:58:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 21:58:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-21 21:58:09,003 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 8 states. [2019-11-21 21:58:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:58:09,485 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-11-21 21:58:09,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 21:58:09,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-21 21:58:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:58:09,499 INFO L225 Difference]: With dead ends: 114 [2019-11-21 21:58:09,499 INFO L226 Difference]: Without dead ends: 111 [2019-11-21 21:58:09,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-21 21:58:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-21 21:58:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-21 21:58:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 21:58:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2019-11-21 21:58:09,561 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 25 [2019-11-21 21:58:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:58:09,562 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2019-11-21 21:58:09,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 21:58:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2019-11-21 21:58:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-21 21:58:09,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:58:09,565 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:58:09,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:09,768 INFO L410 AbstractCegarLoop]: === Iteration 2 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:58:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:58:09,769 INFO L82 PathProgramCache]: Analyzing trace with hash -993650763, now seen corresponding path program 1 times [2019-11-21 21:58:09,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:58:09,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1681004487] [2019-11-21 21:58:09,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:58:09,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:58:09,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:58:09,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:09,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:58:09,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:09,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:10,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 21:58:10,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:10,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:10,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:10,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2019-11-21 21:58:10,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:58:10,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 21:58:10,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:10,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:10,137 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:10,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 21:58:10,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:10,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:10,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 21:58:10,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-21 21:58:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:58:10,344 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:58:10,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:10,896 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:58:10,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 21:58:10,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:10,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:10,925 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:58:10,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:10,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:10,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:10,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 21:58:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:58:11,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1681004487] [2019-11-21 21:58:11,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 21:58:11,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2019-11-21 21:58:11,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615644204] [2019-11-21 21:58:11,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 21:58:11,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:58:11,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 21:58:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-21 21:58:11,190 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 8 states. [2019-11-21 21:58:11,945 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:58:12,284 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:58:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:58:18,784 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2019-11-21 21:58:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 21:58:18,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-21 21:58:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:58:18,790 INFO L225 Difference]: With dead ends: 142 [2019-11-21 21:58:18,790 INFO L226 Difference]: Without dead ends: 142 [2019-11-21 21:58:18,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:58:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-21 21:58:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2019-11-21 21:58:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-21 21:58:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2019-11-21 21:58:18,827 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 25 [2019-11-21 21:58:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:58:18,828 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2019-11-21 21:58:18,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 21:58:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2019-11-21 21:58:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 21:58:18,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:58:18,831 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:58:19,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:19,041 INFO L410 AbstractCegarLoop]: === Iteration 3 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:58:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:58:19,042 INFO L82 PathProgramCache]: Analyzing trace with hash -738402624, now seen corresponding path program 1 times [2019-11-21 21:58:19,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:58:19,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1127098984] [2019-11-21 21:58:19,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:58:19,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 21:58:19,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:58:19,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 21:58:19,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:19,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:19,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:19,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:58:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:58:19,205 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:58:19,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:58:19,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1127098984] [2019-11-21 21:58:19,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:58:19,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-21 21:58:19,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414174726] [2019-11-21 21:58:19,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 21:58:19,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:58:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 21:58:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 21:58:19,280 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 7 states. [2019-11-21 21:58:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:58:19,683 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-11-21 21:58:19,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 21:58:19,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-21 21:58:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:58:19,686 INFO L225 Difference]: With dead ends: 121 [2019-11-21 21:58:19,686 INFO L226 Difference]: Without dead ends: 121 [2019-11-21 21:58:19,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-21 21:58:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-21 21:58:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-21 21:58:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-21 21:58:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2019-11-21 21:58:19,699 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 26 [2019-11-21 21:58:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:58:19,700 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2019-11-21 21:58:19,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 21:58:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2019-11-21 21:58:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 21:58:19,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:58:19,701 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:58:19,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:19,902 INFO L410 AbstractCegarLoop]: === Iteration 4 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:58:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:58:19,903 INFO L82 PathProgramCache]: Analyzing trace with hash -738402623, now seen corresponding path program 1 times [2019-11-21 21:58:19,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:58:19,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [742064111] [2019-11-21 21:58:19,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:58:20,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 21:58:20,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:58:20,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:20,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 21:58:20,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:20,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:20,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:20,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 21:58:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:58:20,220 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:58:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:58:20,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [742064111] [2019-11-21 21:58:20,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:58:20,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-21 21:58:20,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683942480] [2019-11-21 21:58:20,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 21:58:20,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:58:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 21:58:20,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-21 21:58:20,691 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 15 states. [2019-11-21 21:58:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:58:23,756 INFO L93 Difference]: Finished difference Result 271 states and 292 transitions. [2019-11-21 21:58:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 21:58:23,759 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-11-21 21:58:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:58:23,762 INFO L225 Difference]: With dead ends: 271 [2019-11-21 21:58:23,762 INFO L226 Difference]: Without dead ends: 271 [2019-11-21 21:58:23,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-11-21 21:58:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-21 21:58:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 139. [2019-11-21 21:58:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-21 21:58:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2019-11-21 21:58:23,779 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 26 [2019-11-21 21:58:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:58:23,779 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2019-11-21 21:58:23,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 21:58:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2019-11-21 21:58:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 21:58:23,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:58:23,781 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:58:23,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:23,985 INFO L410 AbstractCegarLoop]: === Iteration 5 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:58:23,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:58:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1567288694, now seen corresponding path program 1 times [2019-11-21 21:58:23,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:58:23,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [930682333] [2019-11-21 21:58:23,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:58:24,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 21:58:24,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:58:24,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:24,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:58:24,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:24,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:24,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 21:58:24,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:24,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:24,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:24,193 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-11-21 21:58:24,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:58:24,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 21:58:24,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:24,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:24,322 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:24,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 21:58:24,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:24,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:24,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 21:58:24,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2019-11-21 21:58:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:58:24,510 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:58:24,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:25,016 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:58:25,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 21:58:25,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:25,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:25,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:58:25,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:25,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:25,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:25,048 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 21:58:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:58:25,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [930682333] [2019-11-21 21:58:25,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:58:25,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-21 21:58:25,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175508810] [2019-11-21 21:58:25,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 21:58:25,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:58:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 21:58:25,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-21 21:58:25,302 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 18 states. [2019-11-21 21:58:26,420 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:58:27,066 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:58:33,308 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-21 21:58:36,150 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 21:58:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:58:42,141 INFO L93 Difference]: Finished difference Result 304 states and 332 transitions. [2019-11-21 21:58:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-21 21:58:42,142 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-21 21:58:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:58:42,147 INFO L225 Difference]: With dead ends: 304 [2019-11-21 21:58:42,147 INFO L226 Difference]: Without dead ends: 304 [2019-11-21 21:58:42,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2019-11-21 21:58:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-21 21:58:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 213. [2019-11-21 21:58:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-21 21:58:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 257 transitions. [2019-11-21 21:58:42,168 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 257 transitions. Word has length 26 [2019-11-21 21:58:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:58:42,168 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 257 transitions. [2019-11-21 21:58:42,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 21:58:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 257 transitions. [2019-11-21 21:58:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 21:58:42,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:58:42,170 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:58:42,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:42,372 INFO L410 AbstractCegarLoop]: === Iteration 6 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:58:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:58:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1443420193, now seen corresponding path program 1 times [2019-11-21 21:58:42,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:58:42,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [472628393] [2019-11-21 21:58:42,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:58:42,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 21:58:42,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:58:42,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:42,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:58:42,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:42,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:42,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 21:58:42,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2019-11-21 21:58:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:58:42,754 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:58:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:58:43,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [472628393] [2019-11-21 21:58:43,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:58:43,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2019-11-21 21:58:43,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254110899] [2019-11-21 21:58:43,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-21 21:58:43,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:58:43,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-21 21:58:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-21 21:58:43,302 INFO L87 Difference]: Start difference. First operand 213 states and 257 transitions. Second operand 19 states. [2019-11-21 21:58:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:58:47,661 INFO L93 Difference]: Finished difference Result 398 states and 460 transitions. [2019-11-21 21:58:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-21 21:58:47,662 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-11-21 21:58:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:58:47,665 INFO L225 Difference]: With dead ends: 398 [2019-11-21 21:58:47,665 INFO L226 Difference]: Without dead ends: 398 [2019-11-21 21:58:47,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2019-11-21 21:58:47,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-11-21 21:58:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 243. [2019-11-21 21:58:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-21 21:58:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 293 transitions. [2019-11-21 21:58:47,686 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 293 transitions. Word has length 28 [2019-11-21 21:58:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:58:47,686 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 293 transitions. [2019-11-21 21:58:47,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-21 21:58:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 293 transitions. [2019-11-21 21:58:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 21:58:47,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:58:47,689 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:58:47,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:47,892 INFO L410 AbstractCegarLoop]: === Iteration 7 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:58:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:58:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1041802485, now seen corresponding path program 2 times [2019-11-21 21:58:47,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:58:47,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1677484923] [2019-11-21 21:58:47,894 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:58:48,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 21:58:48,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:58:48,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 21:58:48,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:58:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:58:48,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 21:58:48,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:48,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:48,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:58:48,132 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:48,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:48,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:48,143 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2019-11-21 21:58:48,259 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:48,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 21:58:48,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:48,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:48,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 21:58:48,284 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:48,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:48,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 21:58:48,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:33 [2019-11-21 21:58:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:58:48,523 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:58:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:58:49,082 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:58:49,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 21:58:49,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:49,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:49,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:58:49,103 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:58:49,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:58:49,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:58:49,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 21:58:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:58:49,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1677484923] [2019-11-21 21:58:49,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:58:49,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-11-21 21:58:49,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752677445] [2019-11-21 21:58:49,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-21 21:58:49,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:58:49,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-21 21:58:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2019-11-21 21:58:49,647 INFO L87 Difference]: Start difference. First operand 243 states and 293 transitions. Second operand 24 states. [2019-11-21 21:58:52,011 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:58:52,931 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:59:00,622 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 21:59:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:59:07,133 INFO L93 Difference]: Finished difference Result 432 states and 503 transitions. [2019-11-21 21:59:07,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-21 21:59:07,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2019-11-21 21:59:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:59:07,138 INFO L225 Difference]: With dead ends: 432 [2019-11-21 21:59:07,138 INFO L226 Difference]: Without dead ends: 432 [2019-11-21 21:59:07,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=391, Invalid=2059, Unknown=0, NotChecked=0, Total=2450 [2019-11-21 21:59:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-21 21:59:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 249. [2019-11-21 21:59:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-21 21:59:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 304 transitions. [2019-11-21 21:59:07,157 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 304 transitions. Word has length 29 [2019-11-21 21:59:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:59:07,158 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 304 transitions. [2019-11-21 21:59:07,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-21 21:59:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 304 transitions. [2019-11-21 21:59:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-21 21:59:07,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:59:07,160 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1] [2019-11-21 21:59:07,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:07,362 INFO L410 AbstractCegarLoop]: === Iteration 8 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:59:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:59:07,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1192539356, now seen corresponding path program 1 times [2019-11-21 21:59:07,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:59:07,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1789804647] [2019-11-21 21:59:07,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:59:07,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 21:59:07,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:59:07,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:07,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:59:07,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:07,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:07,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:59:07,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-21 21:59:07,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-11-21 21:59:07,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:07,674 INFO L567 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2019-11-21 21:59:07,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:59:07,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2019-11-21 21:59:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:59:07,739 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:59:07,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:08,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:08,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1789804647] [2019-11-21 21:59:08,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 21:59:08,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-11-21 21:59:08,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816396721] [2019-11-21 21:59:08,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 21:59:08,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:59:08,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 21:59:08,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:59:08,195 INFO L87 Difference]: Start difference. First operand 249 states and 304 transitions. Second operand 11 states. [2019-11-21 21:59:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:59:09,563 INFO L93 Difference]: Finished difference Result 271 states and 328 transitions. [2019-11-21 21:59:09,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 21:59:09,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-11-21 21:59:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:59:09,567 INFO L225 Difference]: With dead ends: 271 [2019-11-21 21:59:09,567 INFO L226 Difference]: Without dead ends: 271 [2019-11-21 21:59:09,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-11-21 21:59:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-21 21:59:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2019-11-21 21:59:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-21 21:59:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 309 transitions. [2019-11-21 21:59:09,579 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 309 transitions. Word has length 30 [2019-11-21 21:59:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:59:09,580 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 309 transitions. [2019-11-21 21:59:09,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 21:59:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 309 transitions. [2019-11-21 21:59:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 21:59:09,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:59:09,582 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, 1, 1] [2019-11-21 21:59:09,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:09,785 INFO L410 AbstractCegarLoop]: === Iteration 9 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:59:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:59:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1705427517, now seen corresponding path program 1 times [2019-11-21 21:59:09,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:59:09,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2112541679] [2019-11-21 21:59:09,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:59:09,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 21:59:09,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:59:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:10,038 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:59:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-21 21:59:10,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2112541679] [2019-11-21 21:59:10,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 21:59:10,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2019-11-21 21:59:10,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178659501] [2019-11-21 21:59:10,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 21:59:10,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:59:10,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 21:59:10,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-21 21:59:10,186 INFO L87 Difference]: Start difference. First operand 254 states and 309 transitions. Second operand 6 states. [2019-11-21 21:59:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:59:10,340 INFO L93 Difference]: Finished difference Result 277 states and 334 transitions. [2019-11-21 21:59:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 21:59:10,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-21 21:59:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:59:10,349 INFO L225 Difference]: With dead ends: 277 [2019-11-21 21:59:10,349 INFO L226 Difference]: Without dead ends: 277 [2019-11-21 21:59:10,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-21 21:59:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-21 21:59:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 261. [2019-11-21 21:59:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-21 21:59:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 317 transitions. [2019-11-21 21:59:10,360 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 317 transitions. Word has length 32 [2019-11-21 21:59:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:59:10,360 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 317 transitions. [2019-11-21 21:59:10,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 21:59:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 317 transitions. [2019-11-21 21:59:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 21:59:10,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:59:10,368 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:59:10,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:10,571 INFO L410 AbstractCegarLoop]: === Iteration 10 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:59:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:59:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash 154722375, now seen corresponding path program 1 times [2019-11-21 21:59:10,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:59:10,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1690306052] [2019-11-21 21:59:10,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:59:10,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:59:10,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:59:10,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:10,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:59:10,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:10,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:10,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 21:59:10,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-11-21 21:59:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:59:10,951 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:59:11,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:59:11,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:11,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:11,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:11,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1690306052] [2019-11-21 21:59:11,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:59:11,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-11-21 21:59:11,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965995850] [2019-11-21 21:59:11,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 21:59:11,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:59:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 21:59:11,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-11-21 21:59:11,965 INFO L87 Difference]: Start difference. First operand 261 states and 317 transitions. Second operand 20 states. [2019-11-21 21:59:13,749 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 21:59:14,440 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-21 21:59:14,963 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-21 21:59:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:59:19,109 INFO L93 Difference]: Finished difference Result 447 states and 519 transitions. [2019-11-21 21:59:19,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-21 21:59:19,112 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-11-21 21:59:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:59:19,116 INFO L225 Difference]: With dead ends: 447 [2019-11-21 21:59:19,116 INFO L226 Difference]: Without dead ends: 447 [2019-11-21 21:59:19,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2019-11-21 21:59:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-21 21:59:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 292. [2019-11-21 21:59:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-21 21:59:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 351 transitions. [2019-11-21 21:59:19,131 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 351 transitions. Word has length 32 [2019-11-21 21:59:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:59:19,131 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 351 transitions. [2019-11-21 21:59:19,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 21:59:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 351 transitions. [2019-11-21 21:59:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 21:59:19,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:59:19,133 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:59:19,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:19,336 INFO L410 AbstractCegarLoop]: === Iteration 11 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:59:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:59:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash -140798844, now seen corresponding path program 1 times [2019-11-21 21:59:19,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:59:19,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1749322783] [2019-11-21 21:59:19,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:59:19,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 21:59:19,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:59:19,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:19,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:59:19,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:19,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:19,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 21:59:19,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:19,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:19,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:59:19,588 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-11-21 21:59:19,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:59:19,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 21:59:19,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:19,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:19,715 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:19,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 21:59:19,716 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:19,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:19,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 21:59:19,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-11-21 21:59:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:59:20,016 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:59:20,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:20,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:59:20,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:59:21,016 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:59:21,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 21:59:21,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:21,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:21,043 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:59:21,044 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:21,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:21,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:59:21,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 21:59:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:21,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1749322783] [2019-11-21 21:59:21,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:59:21,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-11-21 21:59:21,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368992937] [2019-11-21 21:59:21,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-21 21:59:21,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:59:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-21 21:59:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-11-21 21:59:21,642 INFO L87 Difference]: Start difference. First operand 292 states and 351 transitions. Second operand 23 states. [2019-11-21 21:59:24,153 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-21 21:59:24,932 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-21 21:59:25,532 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 21:59:26,845 WARN L192 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-21 21:59:27,934 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-21 21:59:28,947 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-21 21:59:32,234 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:59:36,837 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-11-21 21:59:37,628 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-21 21:59:38,929 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-21 21:59:39,239 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-21 21:59:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:59:39,595 INFO L93 Difference]: Finished difference Result 495 states and 575 transitions. [2019-11-21 21:59:39,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-21 21:59:39,595 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-11-21 21:59:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:59:39,598 INFO L225 Difference]: With dead ends: 495 [2019-11-21 21:59:39,598 INFO L226 Difference]: Without dead ends: 495 [2019-11-21 21:59:39,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=394, Invalid=1958, Unknown=0, NotChecked=0, Total=2352 [2019-11-21 21:59:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-21 21:59:39,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 308. [2019-11-21 21:59:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-21 21:59:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 369 transitions. [2019-11-21 21:59:39,614 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 369 transitions. Word has length 32 [2019-11-21 21:59:39,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:59:39,614 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 369 transitions. [2019-11-21 21:59:39,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-21 21:59:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 369 transitions. [2019-11-21 21:59:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 21:59:39,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:59:39,616 INFO L410 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:59:39,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:39,819 INFO L410 AbstractCegarLoop]: === Iteration 12 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:59:39,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:59:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1012120863, now seen corresponding path program 2 times [2019-11-21 21:59:39,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:59:39,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1860769659] [2019-11-21 21:59:39,821 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:39,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 21:59:39,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:59:39,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 21:59:39,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:59:40,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:40,105 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:59:40,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:40,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:40,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 21:59:40,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2019-11-21 21:59:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:59:40,340 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:59:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:41,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1860769659] [2019-11-21 21:59:41,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:59:41,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-21 21:59:41,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911738421] [2019-11-21 21:59:41,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-21 21:59:41,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:59:41,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-21 21:59:41,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-11-21 21:59:41,607 INFO L87 Difference]: Start difference. First operand 308 states and 369 transitions. Second operand 27 states. [2019-11-21 21:59:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:59:49,640 INFO L93 Difference]: Finished difference Result 508 states and 589 transitions. [2019-11-21 21:59:49,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-21 21:59:49,641 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-21 21:59:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:59:49,644 INFO L225 Difference]: With dead ends: 508 [2019-11-21 21:59:49,644 INFO L226 Difference]: Without dead ends: 508 [2019-11-21 21:59:49,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=521, Invalid=2235, Unknown=0, NotChecked=0, Total=2756 [2019-11-21 21:59:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-21 21:59:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 342. [2019-11-21 21:59:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-21 21:59:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 412 transitions. [2019-11-21 21:59:49,658 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 412 transitions. Word has length 32 [2019-11-21 21:59:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:59:49,659 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 412 transitions. [2019-11-21 21:59:49,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-21 21:59:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 412 transitions. [2019-11-21 21:59:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-21 21:59:49,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:59:49,661 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:59:49,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:49,866 INFO L410 AbstractCegarLoop]: === Iteration 13 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:59:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:59:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1956466685, now seen corresponding path program 1 times [2019-11-21 21:59:49,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:59:49,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [45073106] [2019-11-21 21:59:49,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:59:49,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 21:59:49,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:59:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:50,047 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:59:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:50,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [45073106] [2019-11-21 21:59:50,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:59:50,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-21 21:59:50,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456998103] [2019-11-21 21:59:50,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 21:59:50,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:59:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 21:59:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-21 21:59:50,206 INFO L87 Difference]: Start difference. First operand 342 states and 412 transitions. Second operand 14 states. [2019-11-21 21:59:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:59:50,627 INFO L93 Difference]: Finished difference Result 413 states and 491 transitions. [2019-11-21 21:59:50,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 21:59:50,628 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-21 21:59:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:59:50,630 INFO L225 Difference]: With dead ends: 413 [2019-11-21 21:59:50,631 INFO L226 Difference]: Without dead ends: 413 [2019-11-21 21:59:50,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-21 21:59:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-21 21:59:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 359. [2019-11-21 21:59:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-11-21 21:59:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 434 transitions. [2019-11-21 21:59:50,645 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 434 transitions. Word has length 34 [2019-11-21 21:59:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:59:50,646 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 434 transitions. [2019-11-21 21:59:50,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 21:59:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 434 transitions. [2019-11-21 21:59:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 21:59:50,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:59:50,648 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 21:59:50,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:50,859 INFO L410 AbstractCegarLoop]: === Iteration 14 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:59:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:59:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1772696709, now seen corresponding path program 1 times [2019-11-21 21:59:50,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:59:50,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [638382023] [2019-11-21 21:59:50,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:59:50,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 21:59:50,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:59:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:51,082 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:59:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:51,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [638382023] [2019-11-21 21:59:51,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:59:51,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-21 21:59:51,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865107370] [2019-11-21 21:59:51,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 21:59:51,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:59:51,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 21:59:51,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-21 21:59:51,368 INFO L87 Difference]: Start difference. First operand 359 states and 434 transitions. Second operand 16 states. [2019-11-21 21:59:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:59:52,104 INFO L93 Difference]: Finished difference Result 395 states and 462 transitions. [2019-11-21 21:59:52,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-21 21:59:52,105 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-11-21 21:59:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:59:52,107 INFO L225 Difference]: With dead ends: 395 [2019-11-21 21:59:52,107 INFO L226 Difference]: Without dead ends: 395 [2019-11-21 21:59:52,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:59:52,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-11-21 21:59:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 353. [2019-11-21 21:59:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-21 21:59:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 418 transitions. [2019-11-21 21:59:52,118 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 418 transitions. Word has length 37 [2019-11-21 21:59:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:59:52,119 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 418 transitions. [2019-11-21 21:59:52,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 21:59:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 418 transitions. [2019-11-21 21:59:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 21:59:52,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:59:52,121 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1] [2019-11-21 21:59:52,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:52,329 INFO L410 AbstractCegarLoop]: === Iteration 15 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 21:59:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:59:52,329 INFO L82 PathProgramCache]: Analyzing trace with hash 545371762, now seen corresponding path program 2 times [2019-11-21 21:59:52,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:59:52,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1848201112] [2019-11-21 21:59:52,330 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:59:52,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 21:59:52,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:59:52,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-21 21:59:52,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:59:52,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:52,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 21:59:52,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:59:52,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:59:52,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:59:52,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2019-11-21 21:59:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:59:53,043 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:59:54,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:59:54,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 21:59:54,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 21:59:54,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 21:59:54,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:59:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:59:55,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1848201112] [2019-11-21 21:59:55,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:59:55,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-11-21 21:59:55,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730549422] [2019-11-21 21:59:55,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-21 21:59:55,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:59:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-21 21:59:55,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-11-21 21:59:55,454 INFO L87 Difference]: Start difference. First operand 353 states and 418 transitions. Second operand 31 states. [2019-11-21 21:59:59,398 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-21 22:00:00,313 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-11-21 22:00:00,974 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-21 22:00:01,568 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 22:00:02,049 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 22:00:02,994 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-21 22:00:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:00:07,919 INFO L93 Difference]: Finished difference Result 480 states and 552 transitions. [2019-11-21 22:00:07,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-21 22:00:07,921 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-11-21 22:00:07,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:00:07,925 INFO L225 Difference]: With dead ends: 480 [2019-11-21 22:00:07,925 INFO L226 Difference]: Without dead ends: 480 [2019-11-21 22:00:07,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=472, Invalid=2608, Unknown=0, NotChecked=0, Total=3080 [2019-11-21 22:00:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-21 22:00:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 342. [2019-11-21 22:00:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-21 22:00:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 409 transitions. [2019-11-21 22:00:07,938 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 409 transitions. Word has length 35 [2019-11-21 22:00:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:00:07,938 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 409 transitions. [2019-11-21 22:00:07,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-21 22:00:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 409 transitions. [2019-11-21 22:00:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 22:00:07,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:00:07,940 INFO L410 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:00:08,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:00:08,142 INFO L410 AbstractCegarLoop]: === Iteration 16 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:00:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:00:08,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1450357547, now seen corresponding path program 3 times [2019-11-21 22:00:08,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:00:08,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [530172657] [2019-11-21 22:00:08,144 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:00:08,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-21 22:00:08,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:00:08,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 22:00:08,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:00:08,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:00:08,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:00:08,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:08,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:08,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:00:08,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:08,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:08,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:00:08,548 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:39 [2019-11-21 22:00:08,740 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:08,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:00:08,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:08,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:08,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:00:08,764 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:08,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:08,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 22:00:08,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:45 [2019-11-21 22:00:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 22:00:09,182 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:00:09,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:00:10,194 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:00:10,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 22:00:10,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:10,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:10,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:00:10,217 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:10,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:10,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:00:10,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 22:00:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:00:11,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [530172657] [2019-11-21 22:00:11,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:00:11,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2019-11-21 22:00:11,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974125006] [2019-11-21 22:00:11,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-21 22:00:11,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:00:11,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-21 22:00:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2019-11-21 22:00:11,573 INFO L87 Difference]: Start difference. First operand 342 states and 409 transitions. Second operand 36 states. [2019-11-21 22:00:14,457 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 22:00:15,539 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-21 22:00:15,816 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 22:00:16,311 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 22:00:17,024 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 22:00:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:00:23,244 INFO L93 Difference]: Finished difference Result 415 states and 491 transitions. [2019-11-21 22:00:23,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-21 22:00:23,246 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-11-21 22:00:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:00:23,248 INFO L225 Difference]: With dead ends: 415 [2019-11-21 22:00:23,248 INFO L226 Difference]: Without dead ends: 415 [2019-11-21 22:00:23,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1098, Invalid=4304, Unknown=0, NotChecked=0, Total=5402 [2019-11-21 22:00:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-11-21 22:00:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 350. [2019-11-21 22:00:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-21 22:00:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 424 transitions. [2019-11-21 22:00:23,261 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 424 transitions. Word has length 35 [2019-11-21 22:00:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:00:23,261 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 424 transitions. [2019-11-21 22:00:23,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-21 22:00:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 424 transitions. [2019-11-21 22:00:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-21 22:00:23,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:00:23,263 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:00:23,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:00:23,469 INFO L410 AbstractCegarLoop]: === Iteration 17 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:00:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:00:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash 94312874, now seen corresponding path program 2 times [2019-11-21 22:00:23,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:00:23,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2095552651] [2019-11-21 22:00:23,470 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:00:23,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 22:00:23,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:00:23,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 22:00:23,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:00:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:00:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:00:23,763 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:00:23,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:00:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:00:24,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2095552651] [2019-11-21 22:00:24,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:00:24,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-11-21 22:00:24,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595526517] [2019-11-21 22:00:24,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-21 22:00:24,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:00:24,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-21 22:00:24,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-11-21 22:00:24,008 INFO L87 Difference]: Start difference. First operand 350 states and 424 transitions. Second operand 19 states. [2019-11-21 22:00:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:00:24,936 INFO L93 Difference]: Finished difference Result 386 states and 463 transitions. [2019-11-21 22:00:24,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 22:00:24,936 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-11-21 22:00:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:00:24,938 INFO L225 Difference]: With dead ends: 386 [2019-11-21 22:00:24,938 INFO L226 Difference]: Without dead ends: 386 [2019-11-21 22:00:24,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-11-21 22:00:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-21 22:00:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 354. [2019-11-21 22:00:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-11-21 22:00:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 428 transitions. [2019-11-21 22:00:24,948 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 428 transitions. Word has length 36 [2019-11-21 22:00:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:00:24,949 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 428 transitions. [2019-11-21 22:00:24,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-21 22:00:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 428 transitions. [2019-11-21 22:00:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-21 22:00:24,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:00:24,950 INFO L410 BasicCegarLoop]: trace histogram [6, 2, 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, 1] [2019-11-21 22:00:25,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:00:25,153 INFO L410 AbstractCegarLoop]: === Iteration 18 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:00:25,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:00:25,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1140089020, now seen corresponding path program 3 times [2019-11-21 22:00:25,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:00:25,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [418449197] [2019-11-21 22:00:25,155 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:00:25,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-21 22:00:25,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:00:25,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 22:00:25,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:00:25,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:00:25,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:25,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:25,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:00:25,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:25,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:25,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:00:25,327 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-11-21 22:00:25,385 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:25,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:00:25,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:25,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:25,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:00:25,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:25,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:25,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 22:00:25,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2019-11-21 22:00:35,762 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-21 22:00:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-21 22:00:35,938 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:00:41,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:00:41,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:00:41,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:00:43,600 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:00:43,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 22:00:43,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:43,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:43,624 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:00:43,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:00:43,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:00:43,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:00:43,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:12 [2019-11-21 22:00:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-21 22:00:43,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [418449197] [2019-11-21 22:00:43,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:00:43,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2019-11-21 22:00:43,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169781906] [2019-11-21 22:00:43,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 22:00:43,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:00:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 22:00:43,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=310, Unknown=6, NotChecked=0, Total=380 [2019-11-21 22:00:43,899 INFO L87 Difference]: Start difference. First operand 354 states and 428 transitions. Second operand 20 states. [2019-11-21 22:00:57,166 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-21 22:00:58,937 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-11-21 22:00:59,305 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-21 22:01:08,454 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-21 22:01:08,943 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-11-21 22:01:10,185 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-21 22:01:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:01:12,624 INFO L93 Difference]: Finished difference Result 470 states and 554 transitions. [2019-11-21 22:01:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-21 22:01:12,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-21 22:01:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:01:12,626 INFO L225 Difference]: With dead ends: 470 [2019-11-21 22:01:12,626 INFO L226 Difference]: Without dead ends: 470 [2019-11-21 22:01:12,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=261, Invalid=855, Unknown=6, NotChecked=0, Total=1122 [2019-11-21 22:01:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-21 22:01:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 326. [2019-11-21 22:01:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-11-21 22:01:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 387 transitions. [2019-11-21 22:01:12,636 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 387 transitions. Word has length 36 [2019-11-21 22:01:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:01:12,636 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 387 transitions. [2019-11-21 22:01:12,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 22:01:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 387 transitions. [2019-11-21 22:01:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-21 22:01:12,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:01:12,638 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:01:12,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:01:12,841 INFO L410 AbstractCegarLoop]: === Iteration 19 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:01:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:01:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1947825803, now seen corresponding path program 1 times [2019-11-21 22:01:12,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:01:12,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1778136156] [2019-11-21 22:01:12,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:01:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:01:12,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 22:01:12,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:01:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:01:13,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:01:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:01:13,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778136156] [2019-11-21 22:01:13,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 22:01:13,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 22:01:13,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163795174] [2019-11-21 22:01:13,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 22:01:13,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:01:13,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 22:01:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 22:01:13,022 INFO L87 Difference]: Start difference. First operand 326 states and 387 transitions. Second operand 6 states. [2019-11-21 22:01:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:01:13,355 INFO L93 Difference]: Finished difference Result 321 states and 375 transitions. [2019-11-21 22:01:13,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 22:01:13,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-21 22:01:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:01:13,358 INFO L225 Difference]: With dead ends: 321 [2019-11-21 22:01:13,358 INFO L226 Difference]: Without dead ends: 321 [2019-11-21 22:01:13,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-21 22:01:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-21 22:01:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 320. [2019-11-21 22:01:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-21 22:01:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 375 transitions. [2019-11-21 22:01:13,366 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 375 transitions. Word has length 39 [2019-11-21 22:01:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:01:13,366 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 375 transitions. [2019-11-21 22:01:13,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 22:01:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 375 transitions. [2019-11-21 22:01:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-21 22:01:13,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:01:13,368 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:01:13,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:01:13,571 INFO L410 AbstractCegarLoop]: === Iteration 20 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:01:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:01:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1947825804, now seen corresponding path program 1 times [2019-11-21 22:01:13,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:01:13,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1636937491] [2019-11-21 22:01:13,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:01:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:01:13,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 22:01:13,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:01:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:01:14,116 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:01:14,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:01:14,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2019-11-21 22:01:14,806 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:01:14,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-11-21 22:01:14,831 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:01:14,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-11-21 22:01:14,852 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:01:14,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:01:14,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-21 22:01:14,953 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:81, output treesize:73 [2019-11-21 22:01:15,296 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-21 22:01:15,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:01:15,855 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-11-21 22:01:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:01:16,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1636937491] [2019-11-21 22:01:16,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:01:16,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-21 22:01:16,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989141435] [2019-11-21 22:01:16,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 22:01:16,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:01:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 22:01:16,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-11-21 22:01:16,236 INFO L87 Difference]: Start difference. First operand 320 states and 375 transitions. Second operand 21 states. [2019-11-21 22:01:17,706 WARN L192 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-21 22:01:18,268 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-21 22:01:19,100 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-21 22:01:20,983 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 22:01:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:01:23,711 INFO L93 Difference]: Finished difference Result 354 states and 400 transitions. [2019-11-21 22:01:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 22:01:23,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-11-21 22:01:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:01:23,714 INFO L225 Difference]: With dead ends: 354 [2019-11-21 22:01:23,714 INFO L226 Difference]: Without dead ends: 354 [2019-11-21 22:01:23,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2019-11-21 22:01:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-21 22:01:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 284. [2019-11-21 22:01:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-21 22:01:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 326 transitions. [2019-11-21 22:01:23,722 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 326 transitions. Word has length 39 [2019-11-21 22:01:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:01:23,723 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 326 transitions. [2019-11-21 22:01:23,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 22:01:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 326 transitions. [2019-11-21 22:01:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-21 22:01:23,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:01:23,725 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:01:23,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:01:23,927 INFO L410 AbstractCegarLoop]: === Iteration 21 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:01:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:01:23,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1368359231, now seen corresponding path program 3 times [2019-11-21 22:01:23,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:01:23,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [109962999] [2019-11-21 22:01:23,928 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:01:24,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-21 22:01:24,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:01:24,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-21 22:01:24,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:01:24,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:01:24,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:01:24,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:01:24,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:01:24,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:01:24,189 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:01:24,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:01:24,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:01:24,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:37 [2019-11-21 22:01:24,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 22:01:24,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:01:24,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:01:24,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:01:24,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:01:24,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:01:24,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:01:24,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:01:24,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:01:24,372 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:46 [2019-11-21 22:01:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:01:25,090 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:01:25,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:01:26,470 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-21 22:01:29,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:01:30,409 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:01:30,411 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:01:30,413 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 22:01:30,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:01:30,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:01:30,414 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-21 22:01:30,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:01:30,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:88, output treesize:1 [2019-11-21 22:01:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-21 22:01:30,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [109962999] [2019-11-21 22:01:30,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:01:30,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 20 [2019-11-21 22:01:30,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884826224] [2019-11-21 22:01:30,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 22:01:30,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:01:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 22:01:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-11-21 22:01:30,493 INFO L87 Difference]: Start difference. First operand 284 states and 326 transitions. Second operand 21 states. [2019-11-21 22:01:33,769 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-21 22:01:35,828 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-21 22:01:36,598 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 22:01:40,441 WARN L192 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 126 DAG size of output: 123 [2019-11-21 22:01:45,091 WARN L192 SmtUtils]: Spent 1.85 s on a formula simplification that was a NOOP. DAG size: 132 [2019-11-21 22:01:47,576 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 22:01:48,345 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-11-21 22:02:01,464 WARN L192 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 82 [2019-11-21 22:02:07,464 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-21 22:02:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:02:09,343 INFO L93 Difference]: Finished difference Result 366 states and 412 transitions. [2019-11-21 22:02:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-21 22:02:09,346 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-11-21 22:02:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:02:09,348 INFO L225 Difference]: With dead ends: 366 [2019-11-21 22:02:09,348 INFO L226 Difference]: Without dead ends: 366 [2019-11-21 22:02:09,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2019-11-21 22:02:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-21 22:02:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 311. [2019-11-21 22:02:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-21 22:02:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 372 transitions. [2019-11-21 22:02:09,357 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 372 transitions. Word has length 38 [2019-11-21 22:02:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:02:09,358 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 372 transitions. [2019-11-21 22:02:09,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 22:02:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 372 transitions. [2019-11-21 22:02:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-21 22:02:09,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:02:09,360 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:02:09,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:09,563 INFO L410 AbstractCegarLoop]: === Iteration 22 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:02:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:02:09,564 INFO L82 PathProgramCache]: Analyzing trace with hash -41231606, now seen corresponding path program 4 times [2019-11-21 22:02:09,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:02:09,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1213620810] [2019-11-21 22:02:09,565 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:09,724 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-21 22:02:09,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:02:09,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-21 22:02:09,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:02:09,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:02:09,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:02:09,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:09,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:09,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:02:09,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:09,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:09,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:02:09,843 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2019-11-21 22:02:09,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:09,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:02:09,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:09,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:09,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:02:09,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:09,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:09,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:02:09,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:33 [2019-11-21 22:02:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 22:02:10,305 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:02:11,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:02:11,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:02:11,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:02:11,756 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:02:11,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 22:02:11,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:11,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:11,784 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:02:11,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:11,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:11,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:02:11,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 22:02:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:02:12,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1213620810] [2019-11-21 22:02:12,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:02:12,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-21 22:02:12,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955736582] [2019-11-21 22:02:12,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-21 22:02:12,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:02:12,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-21 22:02:12,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-11-21 22:02:12,561 INFO L87 Difference]: Start difference. First operand 311 states and 372 transitions. Second operand 27 states. [2019-11-21 22:02:14,608 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 22:02:16,252 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 22:02:17,621 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-21 22:02:19,376 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-11-21 22:02:21,045 WARN L192 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-21 22:02:22,266 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 22:02:23,464 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-21 22:02:24,506 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-21 22:02:27,972 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-21 22:02:30,070 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-11-21 22:02:30,689 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-11-21 22:02:33,019 WARN L192 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-21 22:02:33,399 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 22:02:33,969 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 22:02:34,372 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-21 22:02:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:02:34,801 INFO L93 Difference]: Finished difference Result 562 states and 652 transitions. [2019-11-21 22:02:34,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-21 22:02:34,801 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2019-11-21 22:02:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:02:34,805 INFO L225 Difference]: With dead ends: 562 [2019-11-21 22:02:34,805 INFO L226 Difference]: Without dead ends: 562 [2019-11-21 22:02:34,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=575, Invalid=3085, Unknown=0, NotChecked=0, Total=3660 [2019-11-21 22:02:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-21 22:02:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 368. [2019-11-21 22:02:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-21 22:02:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 435 transitions. [2019-11-21 22:02:34,818 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 435 transitions. Word has length 38 [2019-11-21 22:02:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:02:34,819 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 435 transitions. [2019-11-21 22:02:34,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-21 22:02:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 435 transitions. [2019-11-21 22:02:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 22:02:34,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:02:34,820 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:02:35,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:35,024 INFO L410 AbstractCegarLoop]: === Iteration 23 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:02:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:02:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1910871165, now seen corresponding path program 1 times [2019-11-21 22:02:35,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:02:35,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1939504765] [2019-11-21 22:02:35,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:02:35,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 22:02:35,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:02:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-21 22:02:35,181 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:02:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-21 22:02:35,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1939504765] [2019-11-21 22:02:35,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 22:02:35,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 22:02:35,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222796425] [2019-11-21 22:02:35,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 22:02:35,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:02:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 22:02:35,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 22:02:35,198 INFO L87 Difference]: Start difference. First operand 368 states and 435 transitions. Second operand 5 states. [2019-11-21 22:02:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:02:35,454 INFO L93 Difference]: Finished difference Result 366 states and 429 transitions. [2019-11-21 22:02:35,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 22:02:35,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-21 22:02:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:02:35,456 INFO L225 Difference]: With dead ends: 366 [2019-11-21 22:02:35,456 INFO L226 Difference]: Without dead ends: 366 [2019-11-21 22:02:35,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 22:02:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-21 22:02:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-11-21 22:02:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-21 22:02:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 429 transitions. [2019-11-21 22:02:35,464 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 429 transitions. Word has length 40 [2019-11-21 22:02:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:02:35,464 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 429 transitions. [2019-11-21 22:02:35,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 22:02:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 429 transitions. [2019-11-21 22:02:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 22:02:35,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:02:35,466 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:02:35,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:35,669 INFO L410 AbstractCegarLoop]: === Iteration 24 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:02:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:02:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1910871164, now seen corresponding path program 1 times [2019-11-21 22:02:35,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:02:35,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [623573521] [2019-11-21 22:02:35,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:02:35,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 22:02:35,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:02:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:02:35,988 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:02:36,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:02:36,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-21 22:02:36,684 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:02:36,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2019-11-21 22:02:36,698 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:02:36,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-11-21 22:02:36,716 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:02:36,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:36,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-21 22:02:36,816 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-11-21 22:02:37,272 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2019-11-21 22:02:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:02:37,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [623573521] [2019-11-21 22:02:37,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:02:37,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-11-21 22:02:37,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335778091] [2019-11-21 22:02:37,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 22:02:37,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:02:37,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 22:02:37,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-11-21 22:02:37,451 INFO L87 Difference]: Start difference. First operand 365 states and 429 transitions. Second operand 20 states. [2019-11-21 22:02:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:02:42,339 INFO L93 Difference]: Finished difference Result 494 states and 596 transitions. [2019-11-21 22:02:42,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 22:02:42,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-11-21 22:02:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:02:42,344 INFO L225 Difference]: With dead ends: 494 [2019-11-21 22:02:42,344 INFO L226 Difference]: Without dead ends: 494 [2019-11-21 22:02:42,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2019-11-21 22:02:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-11-21 22:02:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 389. [2019-11-21 22:02:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-21 22:02:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 469 transitions. [2019-11-21 22:02:42,356 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 469 transitions. Word has length 40 [2019-11-21 22:02:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:02:42,357 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 469 transitions. [2019-11-21 22:02:42,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 22:02:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 469 transitions. [2019-11-21 22:02:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-21 22:02:42,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:02:42,358 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:02:42,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:42,561 INFO L410 AbstractCegarLoop]: === Iteration 25 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:02:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:02:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash 892536140, now seen corresponding path program 1 times [2019-11-21 22:02:42,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:02:42,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1367488120] [2019-11-21 22:02:42,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:02:42,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-21 22:02:42,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:02:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:02:43,056 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:02:44,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:02:44,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2019-11-21 22:02:44,562 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:02:44,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2019-11-21 22:02:44,582 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:02:44,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-21 22:02:44,609 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:02:44,830 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-11-21 22:02:44,831 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.6 percent of original size [2019-11-21 22:02:44,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-21 22:02:44,832 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:113, output treesize:75 [2019-11-21 22:02:45,497 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-11-21 22:02:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:02:45,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1367488120] [2019-11-21 22:02:45,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:02:45,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-21 22:02:45,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770287845] [2019-11-21 22:02:45,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-21 22:02:45,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:02:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-21 22:02:45,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-11-21 22:02:45,761 INFO L87 Difference]: Start difference. First operand 389 states and 469 transitions. Second operand 24 states. [2019-11-21 22:02:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:02:52,313 INFO L93 Difference]: Finished difference Result 487 states and 592 transitions. [2019-11-21 22:02:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 22:02:52,315 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2019-11-21 22:02:52,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:02:52,317 INFO L225 Difference]: With dead ends: 487 [2019-11-21 22:02:52,317 INFO L226 Difference]: Without dead ends: 487 [2019-11-21 22:02:52,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=242, Invalid=1240, Unknown=0, NotChecked=0, Total=1482 [2019-11-21 22:02:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-21 22:02:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 390. [2019-11-21 22:02:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-11-21 22:02:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 467 transitions. [2019-11-21 22:02:52,328 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 467 transitions. Word has length 41 [2019-11-21 22:02:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:02:52,329 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 467 transitions. [2019-11-21 22:02:52,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-21 22:02:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 467 transitions. [2019-11-21 22:02:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 22:02:52,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:02:52,330 INFO L410 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:02:52,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:52,539 INFO L410 AbstractCegarLoop]: === Iteration 26 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:02:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:02:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash 738785377, now seen corresponding path program 3 times [2019-11-21 22:02:52,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:02:52,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [378417914] [2019-11-21 22:02:52,540 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:02:52,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-21 22:02:52,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:02:52,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 22:02:52,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:02:52,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:02:52,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:52,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:52,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:02:52,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:52,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:52,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:02:52,728 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2019-11-21 22:02:52,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 22:02:52,804 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:02:52,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:52,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:52,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:52,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:02:52,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:02:52,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:02:52,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:02:52,869 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2019-11-21 22:02:57,430 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-21 22:02:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-21 22:02:57,618 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:03:00,045 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-21 22:03:00,449 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-21 22:03:02,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:03:02,901 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:03:02,904 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:03:02,908 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 22:03:02,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:03:02,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:03:02,909 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-21 22:03:02,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:03:02,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:1 [2019-11-21 22:03:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-21 22:03:02,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [378417914] [2019-11-21 22:03:02,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 22:03:02,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-11-21 22:03:02,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611215850] [2019-11-21 22:03:02,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 22:03:02,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:03:02,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 22:03:02,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=245, Unknown=4, NotChecked=0, Total=306 [2019-11-21 22:03:02,948 INFO L87 Difference]: Start difference. First operand 390 states and 467 transitions. Second operand 7 states. [2019-11-21 22:03:04,598 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 22:03:05,316 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-21 22:03:05,967 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-21 22:03:08,415 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-21 22:03:13,094 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-21 22:03:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:03:13,460 INFO L93 Difference]: Finished difference Result 390 states and 466 transitions. [2019-11-21 22:03:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 22:03:13,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-21 22:03:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:03:13,465 INFO L225 Difference]: With dead ends: 390 [2019-11-21 22:03:13,465 INFO L226 Difference]: Without dead ends: 390 [2019-11-21 22:03:13,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=92, Invalid=409, Unknown=5, NotChecked=0, Total=506 [2019-11-21 22:03:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-21 22:03:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2019-11-21 22:03:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-21 22:03:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 453 transitions. [2019-11-21 22:03:13,473 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 453 transitions. Word has length 40 [2019-11-21 22:03:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:03:13,473 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 453 transitions. [2019-11-21 22:03:13,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 22:03:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 453 transitions. [2019-11-21 22:03:13,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-21 22:03:13,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:03:13,475 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:03:13,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:03:13,678 INFO L410 AbstractCegarLoop]: === Iteration 27 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:03:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:03:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1177127925, now seen corresponding path program 1 times [2019-11-21 22:03:13,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:03:13,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [293816116] [2019-11-21 22:03:13,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:03:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:03:13,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 22:03:13,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:03:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:03:13,886 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:03:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:03:16,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [293816116] [2019-11-21 22:03:16,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 22:03:16,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-21 22:03:16,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967676592] [2019-11-21 22:03:16,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 22:03:16,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:03:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 22:03:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-21 22:03:16,587 INFO L87 Difference]: Start difference. First operand 378 states and 453 transitions. Second operand 16 states. [2019-11-21 22:03:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:03:18,407 INFO L93 Difference]: Finished difference Result 420 states and 495 transitions. [2019-11-21 22:03:18,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 22:03:18,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-11-21 22:03:18,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:03:18,417 INFO L225 Difference]: With dead ends: 420 [2019-11-21 22:03:18,417 INFO L226 Difference]: Without dead ends: 420 [2019-11-21 22:03:18,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-21 22:03:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-21 22:03:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 400. [2019-11-21 22:03:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-11-21 22:03:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 475 transitions. [2019-11-21 22:03:18,425 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 475 transitions. Word has length 43 [2019-11-21 22:03:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:03:18,426 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 475 transitions. [2019-11-21 22:03:18,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 22:03:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 475 transitions. [2019-11-21 22:03:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-21 22:03:18,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:03:18,428 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:03:18,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:03:18,633 INFO L410 AbstractCegarLoop]: === Iteration 28 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:03:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:03:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash -643947105, now seen corresponding path program 1 times [2019-11-21 22:03:18,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:03:18,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [314768737] [2019-11-21 22:03:18,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:03:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:03:18,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 22:03:18,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:03:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:03:19,066 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:03:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:03:19,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [314768737] [2019-11-21 22:03:19,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:03:19,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-11-21 22:03:19,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239326777] [2019-11-21 22:03:19,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 22:03:19,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:03:19,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 22:03:19,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-21 22:03:19,476 INFO L87 Difference]: Start difference. First operand 400 states and 475 transitions. Second operand 21 states. [2019-11-21 22:03:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:03:21,221 INFO L93 Difference]: Finished difference Result 528 states and 619 transitions. [2019-11-21 22:03:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-21 22:03:21,223 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-11-21 22:03:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:03:21,226 INFO L225 Difference]: With dead ends: 528 [2019-11-21 22:03:21,226 INFO L226 Difference]: Without dead ends: 528 [2019-11-21 22:03:21,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2019-11-21 22:03:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-21 22:03:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 455. [2019-11-21 22:03:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-21 22:03:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 545 transitions. [2019-11-21 22:03:21,240 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 545 transitions. Word has length 44 [2019-11-21 22:03:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:03:21,241 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 545 transitions. [2019-11-21 22:03:21,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 22:03:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 545 transitions. [2019-11-21 22:03:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-21 22:03:21,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:03:21,242 INFO L410 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:03:21,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:03:21,454 INFO L410 AbstractCegarLoop]: === Iteration 29 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:03:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:03:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash 354238357, now seen corresponding path program 5 times [2019-11-21 22:03:21,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:03:21,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [614960956] [2019-11-21 22:03:21,456 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:03:21,629 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-21 22:03:21,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:03:21,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 22:03:21,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:03:21,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:03:21,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:03:21,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:03:21,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:03:21,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:03:21,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:03:21,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:03:21,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:03:21,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:35 [2019-11-21 22:03:21,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 22:03:21,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:03:21,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:03:22,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:03:22,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:03:22,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:03:22,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:03:22,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:03:22,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 22:03:22,035 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:41 [2019-11-21 22:03:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 22:03:22,801 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:03:24,308 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-11-21 22:03:24,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 22:03:24,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:03:24,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:03:24,968 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-21 22:03:25,216 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:03:25,222 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 22:03:25,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:03:25,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:03:25,244 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:03:25,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:03:25,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:03:25,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:03:25,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 22:03:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:03:26,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [614960956] [2019-11-21 22:03:26,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:03:26,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2019-11-21 22:03:26,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117316043] [2019-11-21 22:03:26,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-21 22:03:26,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:03:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-21 22:03:26,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2019-11-21 22:03:26,929 INFO L87 Difference]: Start difference. First operand 455 states and 545 transitions. Second operand 38 states. [2019-11-21 22:03:29,414 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 22:03:30,947 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-21 22:03:31,853 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 22:03:33,160 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 22:03:33,475 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 22:03:36,657 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-21 22:03:39,122 WARN L192 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-11-21 22:03:41,890 WARN L192 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-11-21 22:03:43,428 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-21 22:03:45,216 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-21 22:03:46,351 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-21 22:03:50,300 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-11-21 22:03:52,221 WARN L192 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-11-21 22:03:53,502 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-21 22:03:55,326 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 22:03:57,058 WARN L192 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-21 22:03:57,753 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 22:03:58,207 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-21 22:03:58,748 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-21 22:03:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:03:59,354 INFO L93 Difference]: Finished difference Result 748 states and 878 transitions. [2019-11-21 22:03:59,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-11-21 22:03:59,354 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 43 [2019-11-21 22:03:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:03:59,357 INFO L225 Difference]: With dead ends: 748 [2019-11-21 22:03:59,357 INFO L226 Difference]: Without dead ends: 748 [2019-11-21 22:03:59,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=1117, Invalid=6539, Unknown=0, NotChecked=0, Total=7656 [2019-11-21 22:03:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-11-21 22:03:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 448. [2019-11-21 22:03:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-21 22:03:59,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 536 transitions. [2019-11-21 22:03:59,372 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 536 transitions. Word has length 43 [2019-11-21 22:03:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:03:59,372 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 536 transitions. [2019-11-21 22:03:59,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-21 22:03:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 536 transitions. [2019-11-21 22:03:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 22:03:59,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:03:59,374 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:03:59,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:03:59,578 INFO L410 AbstractCegarLoop]: === Iteration 30 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:03:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:03:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2041306870, now seen corresponding path program 1 times [2019-11-21 22:03:59,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:03:59,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [997924829] [2019-11-21 22:03:59,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:03:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:03:59,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 22:03:59,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:03:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:03:59,770 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:03:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:03:59,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [997924829] [2019-11-21 22:03:59,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 22:03:59,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 22:03:59,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696993867] [2019-11-21 22:03:59,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 22:03:59,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:03:59,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 22:03:59,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 22:03:59,787 INFO L87 Difference]: Start difference. First operand 448 states and 536 transitions. Second operand 6 states. [2019-11-21 22:04:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:04:00,076 INFO L93 Difference]: Finished difference Result 448 states and 534 transitions. [2019-11-21 22:04:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 22:04:00,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-21 22:04:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:04:00,079 INFO L225 Difference]: With dead ends: 448 [2019-11-21 22:04:00,079 INFO L226 Difference]: Without dead ends: 448 [2019-11-21 22:04:00,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-21 22:04:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-11-21 22:04:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 447. [2019-11-21 22:04:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-11-21 22:04:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 534 transitions. [2019-11-21 22:04:00,088 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 534 transitions. Word has length 47 [2019-11-21 22:04:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:04:00,088 INFO L462 AbstractCegarLoop]: Abstraction has 447 states and 534 transitions. [2019-11-21 22:04:00,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 22:04:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 534 transitions. [2019-11-21 22:04:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 22:04:00,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:04:00,090 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:04:00,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:00,292 INFO L410 AbstractCegarLoop]: === Iteration 31 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:04:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:04:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2041306869, now seen corresponding path program 1 times [2019-11-21 22:04:00,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:04:00,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [893327313] [2019-11-21 22:04:00,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:04:00,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 22:04:00,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:04:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:04:00,707 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:04:01,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:04:01,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-11-21 22:04:01,175 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:04:01,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2019-11-21 22:04:01,188 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:04:01,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-21 22:04:01,201 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:04:01,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:01,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-11-21 22:04:01,254 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2019-11-21 22:04:01,707 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:01,707 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 34 treesize of output 38 [2019-11-21 22:04:01,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,709 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 22:04:01,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:01,736 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 35 treesize of output 39 [2019-11-21 22:04:01,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,738 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 22:04:01,865 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-21 22:04:01,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:01,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-21 22:04:01,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:78 [2019-11-21 22:04:01,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:01,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:02,464 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-21 22:04:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:04:03,322 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-11-21 22:04:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:04:03,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [893327313] [2019-11-21 22:04:03,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:04:03,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-21 22:04:03,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645008471] [2019-11-21 22:04:03,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-21 22:04:03,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:04:03,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-21 22:04:03,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-21 22:04:03,686 INFO L87 Difference]: Start difference. First operand 447 states and 534 transitions. Second operand 24 states. [2019-11-21 22:04:04,993 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-11-21 22:04:05,301 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-21 22:04:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:04:09,318 INFO L93 Difference]: Finished difference Result 509 states and 608 transitions. [2019-11-21 22:04:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 22:04:09,319 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2019-11-21 22:04:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:04:09,321 INFO L225 Difference]: With dead ends: 509 [2019-11-21 22:04:09,321 INFO L226 Difference]: Without dead ends: 509 [2019-11-21 22:04:09,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2019-11-21 22:04:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-11-21 22:04:09,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 451. [2019-11-21 22:04:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-21 22:04:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 540 transitions. [2019-11-21 22:04:09,329 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 540 transitions. Word has length 47 [2019-11-21 22:04:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:04:09,330 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 540 transitions. [2019-11-21 22:04:09,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-21 22:04:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 540 transitions. [2019-11-21 22:04:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-21 22:04:09,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:04:09,332 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:04:09,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:09,534 INFO L410 AbstractCegarLoop]: === Iteration 32 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:04:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:04:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1367439760, now seen corresponding path program 1 times [2019-11-21 22:04:09,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:04:09,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1021726123] [2019-11-21 22:04:09,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:04:09,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 22:04:09,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:04:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:04:09,913 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:04:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:04:10,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1021726123] [2019-11-21 22:04:10,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:04:10,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-11-21 22:04:10,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774945501] [2019-11-21 22:04:10,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-21 22:04:10,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:04:10,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-21 22:04:10,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-11-21 22:04:10,301 INFO L87 Difference]: Start difference. First operand 451 states and 540 transitions. Second operand 23 states. [2019-11-21 22:04:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:04:12,663 INFO L93 Difference]: Finished difference Result 590 states and 694 transitions. [2019-11-21 22:04:12,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-21 22:04:12,665 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-11-21 22:04:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:04:12,667 INFO L225 Difference]: With dead ends: 590 [2019-11-21 22:04:12,667 INFO L226 Difference]: Without dead ends: 590 [2019-11-21 22:04:12,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2019-11-21 22:04:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-11-21 22:04:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 512. [2019-11-21 22:04:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-21 22:04:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 612 transitions. [2019-11-21 22:04:12,677 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 612 transitions. Word has length 45 [2019-11-21 22:04:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:04:12,677 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 612 transitions. [2019-11-21 22:04:12,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-21 22:04:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 612 transitions. [2019-11-21 22:04:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-21 22:04:12,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:04:12,679 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:04:12,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:12,882 INFO L410 AbstractCegarLoop]: === Iteration 33 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:04:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:04:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash -132291445, now seen corresponding path program 1 times [2019-11-21 22:04:12,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:04:12,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1989411683] [2019-11-21 22:04:12,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:04:13,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 22:04:13,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:04:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:04:13,103 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:04:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:04:13,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1989411683] [2019-11-21 22:04:13,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:04:13,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-21 22:04:13,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100357773] [2019-11-21 22:04:13,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 22:04:13,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:04:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 22:04:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-21 22:04:13,282 INFO L87 Difference]: Start difference. First operand 512 states and 612 transitions. Second operand 13 states. [2019-11-21 22:04:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:04:13,727 INFO L93 Difference]: Finished difference Result 545 states and 646 transitions. [2019-11-21 22:04:13,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 22:04:13,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-11-21 22:04:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:04:13,730 INFO L225 Difference]: With dead ends: 545 [2019-11-21 22:04:13,731 INFO L226 Difference]: Without dead ends: 541 [2019-11-21 22:04:13,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-21 22:04:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-11-21 22:04:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 512. [2019-11-21 22:04:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-21 22:04:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 610 transitions. [2019-11-21 22:04:13,745 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 610 transitions. Word has length 50 [2019-11-21 22:04:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:04:13,745 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 610 transitions. [2019-11-21 22:04:13,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 22:04:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 610 transitions. [2019-11-21 22:04:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 22:04:13,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:04:13,747 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:04:13,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:13,950 INFO L410 AbstractCegarLoop]: === Iteration 34 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:04:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:04:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1981302037, now seen corresponding path program 6 times [2019-11-21 22:04:13,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:04:13,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [895936155] [2019-11-21 22:04:13,953 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:14,141 ERROR L271 FreeRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-11-21 22:04:14,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619381681] [2019-11-21 22:04:14,141 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 22:04:14,280 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-21 22:04:14,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:04:14,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-21 22:04:14,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:04:14,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:14,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:04:14,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:14,448 INFO L567 ElimStorePlain]: treesize reduction 6, result has 86.4 percent of original size [2019-11-21 22:04:14,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:04:14,452 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:14,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:14,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:04:14,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2019-11-21 22:04:14,578 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:14,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:04:14,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:14,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:14,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:04:14,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:14,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:14,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:04:14,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:46 [2019-11-21 22:04:15,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 23 [2019-11-21 22:04:15,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:15,445 INFO L567 ElimStorePlain]: treesize reduction 21, result has 60.4 percent of original size [2019-11-21 22:04:15,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:04:15,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:28 [2019-11-21 22:04:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 22:04:15,638 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:04:17,086 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-21 22:04:17,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-21 22:04:17,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 22:04:17,938 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:04:17,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 22:04:17,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:17,979 INFO L567 ElimStorePlain]: treesize reduction 6, result has 81.8 percent of original size [2019-11-21 22:04:17,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:04:17,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:17,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:17,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:04:17,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:14 [2019-11-21 22:04:18,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:04:18,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [895936155] [2019-11-21 22:04:18,676 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-21 22:04:18,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619381681] [2019-11-21 22:04:18,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:04:18,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2019-11-21 22:04:18,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163730733] [2019-11-21 22:04:18,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-21 22:04:18,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:04:18,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-21 22:04:18,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2019-11-21 22:04:18,678 INFO L87 Difference]: Start difference. First operand 512 states and 610 transitions. Second operand 37 states. [2019-11-21 22:04:20,291 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-11-21 22:04:21,746 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 22:04:23,231 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-21 22:04:24,473 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 22:04:25,449 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-21 22:04:26,223 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-21 22:04:27,612 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-21 22:04:28,843 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-21 22:04:29,637 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 22:04:34,036 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-21 22:04:35,347 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 22:04:36,451 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-21 22:04:39,530 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 22:04:40,449 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-21 22:04:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:04:40,515 INFO L93 Difference]: Finished difference Result 500 states and 573 transitions. [2019-11-21 22:04:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-21 22:04:40,518 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2019-11-21 22:04:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:04:40,519 INFO L225 Difference]: With dead ends: 500 [2019-11-21 22:04:40,519 INFO L226 Difference]: Without dead ends: 500 [2019-11-21 22:04:40,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=699, Invalid=3857, Unknown=0, NotChecked=0, Total=4556 [2019-11-21 22:04:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-21 22:04:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 458. [2019-11-21 22:04:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-21 22:04:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 539 transitions. [2019-11-21 22:04:40,530 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 539 transitions. Word has length 47 [2019-11-21 22:04:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:04:40,530 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 539 transitions. [2019-11-21 22:04:40,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-21 22:04:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 539 transitions. [2019-11-21 22:04:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 22:04:40,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:04:40,532 INFO L410 BasicCegarLoop]: trace histogram [22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:04:40,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-21 22:04:40,736 INFO L410 AbstractCegarLoop]: === Iteration 35 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:04:40,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:04:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash 829711509, now seen corresponding path program 4 times [2019-11-21 22:04:40,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:04:40,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [690463851] [2019-11-21 22:04:40,737 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:04:40,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-21 22:04:40,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:04:40,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-21 22:04:40,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:04:41,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:04:41,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:04:41,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:41,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:41,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:04:41,644 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:41,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:41,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:04:41,662 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:63 [2019-11-21 22:04:42,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 22:04:42,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:04:42,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:42,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:42,066 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:42,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:04:42,067 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:42,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:42,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 22:04:42,085 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:69 [2019-11-21 22:04:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 22:04:42,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:04:43,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:04:43,770 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:04:43,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 22:04:43,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:43,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:43,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:04:43,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:04:43,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:04:43,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:04:43,800 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 22:04:44,021 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-21 22:04:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:04:47,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [690463851] [2019-11-21 22:04:47,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:04:47,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2019-11-21 22:04:47,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104714009] [2019-11-21 22:04:47,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-21 22:04:47,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:04:47,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-21 22:04:47,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=2928, Unknown=0, NotChecked=0, Total=3540 [2019-11-21 22:04:47,347 INFO L87 Difference]: Start difference. First operand 458 states and 539 transitions. Second operand 60 states. [2019-11-21 22:04:50,786 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 22:04:53,183 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 22:04:57,021 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-21 22:04:57,603 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-21 22:04:58,079 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-21 22:04:58,448 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-21 22:04:58,903 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-21 22:04:59,254 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-21 22:04:59,721 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-21 22:05:00,051 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-21 22:05:00,447 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-21 22:05:00,774 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 22:05:01,167 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-21 22:05:01,475 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-21 22:05:01,799 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-21 22:05:02,106 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-21 22:05:02,527 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-21 22:05:03,115 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-21 22:05:03,650 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-21 22:05:04,012 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 22:05:04,300 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-21 22:05:04,648 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-21 22:05:05,328 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 22:05:06,044 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 22:05:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:05:16,204 INFO L93 Difference]: Finished difference Result 811 states and 958 transitions. [2019-11-21 22:05:16,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-11-21 22:05:16,205 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 47 [2019-11-21 22:05:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:05:16,208 INFO L225 Difference]: With dead ends: 811 [2019-11-21 22:05:16,209 INFO L226 Difference]: Without dead ends: 811 [2019-11-21 22:05:16,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3493 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=3229, Invalid=14063, Unknown=0, NotChecked=0, Total=17292 [2019-11-21 22:05:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-11-21 22:05:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 495. [2019-11-21 22:05:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-21 22:05:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 600 transitions. [2019-11-21 22:05:16,221 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 600 transitions. Word has length 47 [2019-11-21 22:05:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:05:16,222 INFO L462 AbstractCegarLoop]: Abstraction has 495 states and 600 transitions. [2019-11-21 22:05:16,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-21 22:05:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 600 transitions. [2019-11-21 22:05:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-21 22:05:16,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:05:16,224 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:05:16,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:05:16,426 INFO L410 AbstractCegarLoop]: === Iteration 36 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:05:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:05:16,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1553798517, now seen corresponding path program 1 times [2019-11-21 22:05:16,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:05:16,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [108532473] [2019-11-21 22:05:16,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:05:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:05:16,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 22:05:16,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:05:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 22:05:16,763 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:05:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-21 22:05:17,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [108532473] [2019-11-21 22:05:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:05:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-11-21 22:05:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841209974] [2019-11-21 22:05:17,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 22:05:17,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:05:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 22:05:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-11-21 22:05:17,024 INFO L87 Difference]: Start difference. First operand 495 states and 600 transitions. Second operand 21 states. [2019-11-21 22:05:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:05:18,302 INFO L93 Difference]: Finished difference Result 522 states and 617 transitions. [2019-11-21 22:05:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-21 22:05:18,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-11-21 22:05:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:05:18,305 INFO L225 Difference]: With dead ends: 522 [2019-11-21 22:05:18,305 INFO L226 Difference]: Without dead ends: 522 [2019-11-21 22:05:18,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2019-11-21 22:05:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-21 22:05:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 473. [2019-11-21 22:05:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-11-21 22:05:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2019-11-21 22:05:18,315 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 49 [2019-11-21 22:05:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:05:18,315 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2019-11-21 22:05:18,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 22:05:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2019-11-21 22:05:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-21 22:05:18,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:05:18,317 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:05:18,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:05:18,521 INFO L410 AbstractCegarLoop]: === Iteration 37 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:05:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:05:18,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1114118219, now seen corresponding path program 7 times [2019-11-21 22:05:18,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:05:18,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [195277847] [2019-11-21 22:05:18,523 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:05:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:05:18,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 22:05:18,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:05:18,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:05:18,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:05:18,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:05:18,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:18,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:05:18,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:05:18,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:18,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:05:18,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2019-11-21 22:05:18,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:18,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:05:18,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:05:18,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:18,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:05:18,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:05:18,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:18,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 22:05:18,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:33 [2019-11-21 22:05:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 22:05:19,514 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:05:20,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:05:20,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:05:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:05:21,513 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:05:21,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 22:05:21,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:05:21,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:21,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:05:21,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:05:21,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:21,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:05:21,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 22:05:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:05:22,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [195277847] [2019-11-21 22:05:22,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:05:22,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2019-11-21 22:05:22,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352955120] [2019-11-21 22:05:22,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-21 22:05:22,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:05:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-21 22:05:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2019-11-21 22:05:22,487 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand 33 states. [2019-11-21 22:05:25,093 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 22:05:26,954 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 22:05:28,343 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-21 22:05:30,455 WARN L192 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-11-21 22:05:32,309 WARN L192 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-21 22:05:34,186 WARN L192 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-21 22:05:36,274 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-21 22:05:37,534 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 22:05:38,592 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-11-21 22:05:39,575 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-11-21 22:05:41,034 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-21 22:05:41,799 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-21 22:05:44,694 WARN L192 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-11-21 22:05:45,981 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-11-21 22:05:50,538 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-21 22:05:52,289 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-21 22:05:53,187 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-11-21 22:05:53,594 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 22:05:54,425 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-21 22:05:55,009 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 22:05:55,458 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-21 22:05:55,954 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-11-21 22:05:56,603 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-21 22:05:58,243 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-21 22:05:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:05:58,266 INFO L93 Difference]: Finished difference Result 846 states and 997 transitions. [2019-11-21 22:05:58,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-11-21 22:05:58,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2019-11-21 22:05:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:05:58,273 INFO L225 Difference]: With dead ends: 846 [2019-11-21 22:05:58,273 INFO L226 Difference]: Without dead ends: 846 [2019-11-21 22:05:58,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=1037, Invalid=5605, Unknown=0, NotChecked=0, Total=6642 [2019-11-21 22:05:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-11-21 22:05:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 554. [2019-11-21 22:05:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-11-21 22:05:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 656 transitions. [2019-11-21 22:05:58,282 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 656 transitions. Word has length 49 [2019-11-21 22:05:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:05:58,282 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 656 transitions. [2019-11-21 22:05:58,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-21 22:05:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 656 transitions. [2019-11-21 22:05:58,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-21 22:05:58,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:05:58,284 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:05:58,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:05:58,488 INFO L410 AbstractCegarLoop]: === Iteration 38 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:05:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:05:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -734032430, now seen corresponding path program 1 times [2019-11-21 22:05:58,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:05:58,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [756405055] [2019-11-21 22:05:58,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:05:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:05:58,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 22:05:58,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:05:58,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:05:58,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:05:58,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:58,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:05:58,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 22:05:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 22:05:58,721 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:05:58,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:05:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:05:58,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756405055] [2019-11-21 22:05:58,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 22:05:58,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2019-11-21 22:05:58,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36419354] [2019-11-21 22:05:58,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 22:05:58,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:05:58,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 22:05:58,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 22:05:58,773 INFO L87 Difference]: Start difference. First operand 554 states and 656 transitions. Second operand 9 states. [2019-11-21 22:05:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:05:59,073 INFO L93 Difference]: Finished difference Result 553 states and 654 transitions. [2019-11-21 22:05:59,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 22:05:59,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-21 22:05:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:05:59,082 INFO L225 Difference]: With dead ends: 553 [2019-11-21 22:05:59,082 INFO L226 Difference]: Without dead ends: 553 [2019-11-21 22:05:59,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 11 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-21 22:05:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-21 22:05:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-11-21 22:05:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-11-21 22:05:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 654 transitions. [2019-11-21 22:05:59,089 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 654 transitions. Word has length 54 [2019-11-21 22:05:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:05:59,090 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 654 transitions. [2019-11-21 22:05:59,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 22:05:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 654 transitions. [2019-11-21 22:05:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-21 22:05:59,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:05:59,091 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:05:59,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:05:59,295 INFO L410 AbstractCegarLoop]: === Iteration 39 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:05:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:05:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash -734032429, now seen corresponding path program 1 times [2019-11-21 22:05:59,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:05:59,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1033872602] [2019-11-21 22:05:59,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:05:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:05:59,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 22:05:59,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:05:59,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:05:59,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:05:59,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:05:59,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:05:59,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-21 22:05:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 22:05:59,921 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:06:01,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:06:01,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:06:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:06:01,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1033872602] [2019-11-21 22:06:01,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:06:01,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2019-11-21 22:06:01,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988736694] [2019-11-21 22:06:01,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-21 22:06:01,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:06:01,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-21 22:06:01,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-21 22:06:01,694 INFO L87 Difference]: Start difference. First operand 553 states and 654 transitions. Second operand 19 states. [2019-11-21 22:06:09,565 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 17 [2019-11-21 22:06:10,032 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-21 22:06:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:06:11,089 INFO L93 Difference]: Finished difference Result 603 states and 706 transitions. [2019-11-21 22:06:11,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-21 22:06:11,091 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-11-21 22:06:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:06:11,093 INFO L225 Difference]: With dead ends: 603 [2019-11-21 22:06:11,093 INFO L226 Difference]: Without dead ends: 603 [2019-11-21 22:06:11,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2019-11-21 22:06:11,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-21 22:06:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 559. [2019-11-21 22:06:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-11-21 22:06:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 662 transitions. [2019-11-21 22:06:11,100 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 662 transitions. Word has length 54 [2019-11-21 22:06:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:06:11,100 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 662 transitions. [2019-11-21 22:06:11,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-21 22:06:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 662 transitions. [2019-11-21 22:06:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-21 22:06:11,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:06:11,102 INFO L410 BasicCegarLoop]: trace histogram [18, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:06:11,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:06:11,305 INFO L410 AbstractCegarLoop]: === Iteration 40 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:06:11,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:06:11,305 INFO L82 PathProgramCache]: Analyzing trace with hash -240292683, now seen corresponding path program 8 times [2019-11-21 22:06:11,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:06:11,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1513613456] [2019-11-21 22:06:11,307 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:06:11,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 22:06:11,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 22:06:11,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-21 22:06:11,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:06:11,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:06:11,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 22:06:11,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:06:12,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:06:12,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-21 22:06:12,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:06:12,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:06:12,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:06:12,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:55 [2019-11-21 22:06:12,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:06:12,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 22:06:12,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:06:12,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:06:12,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-21 22:06:12,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:06:12,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:06:12,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 22:06:12,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:61 [2019-11-21 22:06:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 22:06:13,124 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:06:14,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 22:06:14,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:06:14,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 22:06:15,490 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 22:06:15,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 22:06:15,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 22:06:15,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:06:15,519 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 22:06:15,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 22:06:15,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 22:06:15,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 22:06:15,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 22:06:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:06:19,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1513613456] [2019-11-21 22:06:19,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:06:19,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 56 [2019-11-21 22:06:19,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636378633] [2019-11-21 22:06:19,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-11-21 22:06:19,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:06:19,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-11-21 22:06:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=2707, Unknown=0, NotChecked=0, Total=3192 [2019-11-21 22:06:19,462 INFO L87 Difference]: Start difference. First operand 559 states and 662 transitions. Second operand 57 states. [2019-11-21 22:06:21,878 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 22:06:25,246 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 22:06:29,191 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-21 22:06:32,460 WARN L192 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-11-21 22:06:33,464 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-21 22:06:34,538 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-21 22:06:35,119 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-21 22:06:35,521 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-21 22:06:37,150 WARN L192 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-21 22:06:37,679 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-21 22:06:38,054 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-21 22:06:38,736 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 22:06:39,094 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-21 22:06:39,690 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-21 22:06:40,028 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-21 22:06:40,433 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 22:06:40,759 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 22:06:41,123 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-21 22:06:41,441 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 22:06:42,505 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 22:06:42,937 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-21 22:06:43,832 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-21 22:06:44,688 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 22:06:51,519 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-21 22:06:52,679 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-21 22:06:59,006 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-11-21 22:07:00,134 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-11-21 22:07:02,425 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-21 22:07:03,118 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-21 22:07:04,051 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-21 22:07:04,939 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 22:07:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:07:08,554 INFO L93 Difference]: Finished difference Result 930 states and 1077 transitions. [2019-11-21 22:07:08,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-11-21 22:07:08,556 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-11-21 22:07:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:07:08,560 INFO L225 Difference]: With dead ends: 930 [2019-11-21 22:07:08,560 INFO L226 Difference]: Without dead ends: 930 [2019-11-21 22:07:08,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4545 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=3075, Invalid=16665, Unknown=0, NotChecked=0, Total=19740 [2019-11-21 22:07:08,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-11-21 22:07:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 569. [2019-11-21 22:07:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-11-21 22:07:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 675 transitions. [2019-11-21 22:07:08,572 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 675 transitions. Word has length 53 [2019-11-21 22:07:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:07:08,572 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 675 transitions. [2019-11-21 22:07:08,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-11-21 22:07:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 675 transitions. [2019-11-21 22:07:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-21 22:07:08,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:07:08,573 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:07:08,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:07:08,774 INFO L410 AbstractCegarLoop]: === Iteration 41 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:07:08,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:07:08,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1800364854, now seen corresponding path program 1 times [2019-11-21 22:07:08,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:07:08,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1702109692] [2019-11-21 22:07:08,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:07:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 22:07:08,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 22:07:08,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 22:07:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:07:09,031 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 22:07:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 22:07:09,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1702109692] [2019-11-21 22:07:09,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 22:07:09,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-21 22:07:09,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310650476] [2019-11-21 22:07:09,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 22:07:09,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 22:07:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 22:07:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-11-21 22:07:09,236 INFO L87 Difference]: Start difference. First operand 569 states and 675 transitions. Second operand 16 states. [2019-11-21 22:07:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 22:07:09,655 INFO L93 Difference]: Finished difference Result 595 states and 701 transitions. [2019-11-21 22:07:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 22:07:09,657 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-11-21 22:07:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 22:07:09,660 INFO L225 Difference]: With dead ends: 595 [2019-11-21 22:07:09,660 INFO L226 Difference]: Without dead ends: 595 [2019-11-21 22:07:09,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-21 22:07:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-11-21 22:07:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 583. [2019-11-21 22:07:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-21 22:07:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 691 transitions. [2019-11-21 22:07:09,667 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 691 transitions. Word has length 58 [2019-11-21 22:07:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 22:07:09,668 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 691 transitions. [2019-11-21 22:07:09,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 22:07:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 691 transitions. [2019-11-21 22:07:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-21 22:07:09,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 22:07:09,669 INFO L410 BasicCegarLoop]: trace histogram [29, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 22:07:09,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:07:09,870 INFO L410 AbstractCegarLoop]: === Iteration 42 === [upsweepErr5REQUIRES_VIOLATION, upsweepErr0REQUIRES_VIOLATION, upsweepErr1REQUIRES_VIOLATION, upsweepErr2REQUIRES_VIOLATION, upsweepErr3REQUIRES_VIOLATION, upsweepErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr10ENSURES_VIOLATIONMEMORY_LEAK, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr7ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, downsweepErr4REQUIRES_VIOLATION, downsweepErr9REQUIRES_VIOLATION, downsweepErr8REQUIRES_VIOLATION, downsweepErr3REQUIRES_VIOLATION, downsweepErr2REQUIRES_VIOLATION, downsweepErr7REQUIRES_VIOLATION, downsweepErr6REQUIRES_VIOLATION, downsweepErr1REQUIRES_VIOLATION, downsweepErr0REQUIRES_VIOLATION, downsweepErr11REQUIRES_VIOLATION, downsweepErr10REQUIRES_VIOLATION, downsweepErr5REQUIRES_VIOLATION]=== [2019-11-21 22:07:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 22:07:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash -466620982, now seen corresponding path program 5 times [2019-11-21 22:07:09,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 22:07:09,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2145150713] [2019-11-21 22:07:09,871 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:07:10,039 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-11-21 22:07:10,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-21 22:07:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-21 22:07:10,191 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-21 22:07:10,191 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-21 22:07:10,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 22:07:10,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:07:10 BoogieIcfgContainer [2019-11-21 22:07:10,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-21 22:07:10,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-21 22:07:10,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-21 22:07:10,449 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-21 22:07:10,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:58:08" (3/4) ... [2019-11-21 22:07:10,451 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-21 22:07:10,508 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-21 22:07:10,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-21 22:07:10,510 INFO L168 Benchmark]: Toolchain (without parser) took 543487.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 961.7 MB in the beginning and 988.7 MB in the end (delta: -27.0 MB). Peak memory consumption was 122.4 MB. Max. memory is 11.5 GB. [2019-11-21 22:07:10,510 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 22:07:10,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-21 22:07:10,511 INFO L168 Benchmark]: Boogie Preprocessor took 56.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 22:07:10,511 INFO L168 Benchmark]: RCFGBuilder took 848.16 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-11-21 22:07:10,512 INFO L168 Benchmark]: TraceAbstraction took 542124.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.0 MB). Free memory was 1.1 GB in the beginning and 995.6 MB in the end (delta: 88.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2019-11-21 22:07:10,512 INFO L168 Benchmark]: Witness Printer took 60.41 ms. Allocated memory is still 1.2 GB. Free memory was 995.6 MB in the beginning and 988.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-21 22:07:10,514 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 848.16 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 542124.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.0 MB). Free memory was 1.1 GB in the beginning and 995.6 MB in the end (delta: 88.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. * Witness Printer took 60.41 ms. Allocated memory is still 1.2 GB. Free memory was 995.6 MB in the beginning and 988.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 65]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L56] int n = __VERIFIER_nondet_int(); [L59] CALL is_pow2(n) VAL [\old(x)=536870912] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=268435456] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=134217728] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=67108864] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=33554432] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=16777216] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=8388608] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=4194304] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=2097152] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=1048576] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=524288] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=262144] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=131072] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=65536] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=32768] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=16384] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=8192] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=4096] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=2048] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=1024] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=512] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=256] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=128] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=64] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=32] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=16] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=8] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=4] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=2] [L42] COND TRUE ((x % 2) == 0) && x > 1 [L43] x /= 2 VAL [\old(x)=536870912, x=1] [L42] COND FALSE !(((x % 2) == 0) && x > 1) VAL [\old(x)=536870912, x=1] [L44] return (x == 1); VAL [\old(x)=536870912, \result=1, x=1] [L59] RET is_pow2(n) VAL [is_pow2(n)=1, n=536870912] [L60] EXPR, FCALL calloc(n, sizeof(int)) VAL [calloc(n, sizeof(int))={1:0}, n=536870912] [L60] int *a = calloc(n, sizeof(int)); [L62] EXPR, FCALL calloc(n, sizeof(int)) VAL [a={1:0}, calloc(n, sizeof(int))={34636832:0}, calloc(n, sizeof(int))={1:0}, n=536870912] [L62] int *a0 = calloc(n, sizeof(int)); [L63] int i; [L64] i=0 VAL [a={1:0}, a0={34636832:0}, calloc(n, sizeof(int))={34636832:0}, calloc(n, sizeof(int))={1:0}, i=0, n=536870912] [L64] COND TRUE i