./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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-64bit-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 64bit --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:32:25,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 21:32:25,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 21:32:25,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 21:32:25,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 21:32:25,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 21:32:25,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 21:32:25,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 21:32:25,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 21:32:25,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 21:32:25,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 21:32:25,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 21:32:25,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 21:32:25,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 21:32:25,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 21:32:25,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 21:32:25,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 21:32:25,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 21:32:25,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 21:32:25,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 21:32:25,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 21:32:25,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 21:32:25,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 21:32:25,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 21:32:25,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 21:32:25,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 21:32:25,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 21:32:25,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 21:32:25,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 21:32:25,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 21:32:25,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 21:32:25,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 21:32:25,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 21:32:25,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 21:32:25,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 21:32:25,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 21:32:25,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 21:32:25,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 21:32:25,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 21:32:25,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 21:32:25,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 21:32:25,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 21:32:25,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 21:32:25,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 21:32:25,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 21:32:25,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 21:32:25,282 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 21:32:25,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 21:32:25,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 21:32:25,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 21:32:25,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 21:32:25,283 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 21:32:25,283 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 21:32:25,283 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 21:32:25,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 21:32:25,284 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-21 21:32:25,284 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 21:32:25,284 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 21:32:25,284 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 21:32:25,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 21:32:25,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 21:32:25,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 21:32:25,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 21:32:25,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 21:32:25,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 21:32:25,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 21:32:25,286 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 21:32:25,286 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 21:32:25,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 21:32:25,287 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f80b8c4eb15aaab54b9ff42df2afd9ba8d11db1 [2019-11-21 21:32:25,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 21:32:25,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 21:32:25,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 21:32:25,618 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 21:32:25,618 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 21:32:25,619 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:32:25,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9e67c7e/4686bbe00c4646af9e1a78cc4288aef1/FLAG9c0b144de [2019-11-21 21:32:26,226 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 21:32:26,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2019-11-21 21:32:26,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9e67c7e/4686bbe00c4646af9e1a78cc4288aef1/FLAG9c0b144de [2019-11-21 21:32:26,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e9e67c7e/4686bbe00c4646af9e1a78cc4288aef1 [2019-11-21 21:32:26,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 21:32:26,605 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 21:32:26,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 21:32:26,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 21:32:26,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 21:32:26,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:32:26" (1/1) ... [2019-11-21 21:32:26,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2427afeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:26, skipping insertion in model container [2019-11-21 21:32:26,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:32:26" (1/1) ... [2019-11-21 21:32:26,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 21:32:26,654 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 21:32:26,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:32:26,874 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 21:32:26,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 21:32:27,008 INFO L205 MainTranslator]: Completed translation [2019-11-21 21:32:27,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27 WrapperNode [2019-11-21 21:32:27,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 21:32:27,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 21:32:27,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 21:32:27,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 21:32:27,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (1/1) ... [2019-11-21 21:32:27,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (1/1) ... [2019-11-21 21:32:27,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (1/1) ... [2019-11-21 21:32:27,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (1/1) ... [2019-11-21 21:32:27,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (1/1) ... [2019-11-21 21:32:27,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (1/1) ... [2019-11-21 21:32:27,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (1/1) ... [2019-11-21 21:32:27,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 21:32:27,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 21:32:27,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 21:32:27,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 21:32:27,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (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:32:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 21:32:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 21:32:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-21 21:32:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2019-11-21 21:32:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2019-11-21 21:32:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2019-11-21 21:32:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-21 21:32:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 21:32:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 21:32:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 21:32:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 21:32:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 21:32:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-21 21:32:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 21:32:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-21 21:32:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2019-11-21 21:32:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 21:32:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 21:32:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2019-11-21 21:32:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2019-11-21 21:32:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-21 21:32:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 21:32:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 21:32:27,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 21:32:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 21:32:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 21:32:27,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 21:32:27,964 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 21:32:27,964 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-21 21:32:27,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:32:27 BoogieIcfgContainer [2019-11-21 21:32:27,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 21:32:27,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 21:32:27,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 21:32:27,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 21:32:27,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:32:26" (1/3) ... [2019-11-21 21:32:27,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231b4e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:32:27, skipping insertion in model container [2019-11-21 21:32:27,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:32:27" (2/3) ... [2019-11-21 21:32:27,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231b4e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:32:27, skipping insertion in model container [2019-11-21 21:32:27,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:32:27" (3/3) ... [2019-11-21 21:32:27,977 INFO L109 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2019-11-21 21:32:27,988 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 21:32:27,997 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-11-21 21:32:28,011 INFO L249 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-11-21 21:32:28,035 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 21:32:28,035 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 21:32:28,035 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 21:32:28,036 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 21:32:28,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 21:32:28,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 21:32:28,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 21:32:28,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 21:32:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-21 21:32:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-21 21:32:28,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:32:28,082 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:32:28,083 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:32:28,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:32:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash -993650764, now seen corresponding path program 1 times [2019-11-21 21:32:28,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:32:28,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1596967989] [2019-11-21 21:32:28,101 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:32:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:32:28,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:32:28,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:32:28,301 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:32:28,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:28,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:28,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:32:28,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:32:28,399 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:28,399 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:32:28,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:28,437 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 21:32:28,440 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:32:28,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 21:32:28,540 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:32:28,540 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:32:28,635 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:32:28,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1596967989] [2019-11-21 21:32:28,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:32:28,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 7 [2019-11-21 21:32:28,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364428988] [2019-11-21 21:32:28,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 21:32:28,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:32:28,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 21:32:28,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-21 21:32:28,668 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 8 states. [2019-11-21 21:32:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:32:29,203 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2019-11-21 21:32:29,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 21:32:29,206 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-21 21:32:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:32:29,219 INFO L225 Difference]: With dead ends: 114 [2019-11-21 21:32:29,219 INFO L226 Difference]: Without dead ends: 111 [2019-11-21 21:32:29,221 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:32:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-21 21:32:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-21 21:32:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-21 21:32:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2019-11-21 21:32:29,285 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 25 [2019-11-21 21:32:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:32:29,287 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2019-11-21 21:32:29,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 21:32:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2019-11-21 21:32:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-21 21:32:29,291 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:32:29,291 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:32:29,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:32:29,493 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:32:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:32:29,494 INFO L82 PathProgramCache]: Analyzing trace with hash -993650763, now seen corresponding path program 1 times [2019-11-21 21:32:29,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:32:29,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2012935703] [2019-11-21 21:32:29,496 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:32:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:32:29,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:32:29,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:32:29,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:32:29,710 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:32:29,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:29,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:29,730 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:32:29,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:29,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:29,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:32:29,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2019-11-21 21:32:29,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:32:29,874 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:32:29,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:29,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:29,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:29,904 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:32:29,905 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:29,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:29,920 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:32:29,921 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-11-21 21:32:30,127 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:32:30,127 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:32:30,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:32:30,657 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:32:30,686 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:32:30,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:30,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:30,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:32:30,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:30,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:30,724 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:32:30,725 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 21:32:30,983 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:32:30,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2012935703] [2019-11-21 21:32:30,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 21:32:30,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2019-11-21 21:32:30,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829908390] [2019-11-21 21:32:30,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 21:32:30,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:32:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 21:32:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-21 21:32:30,987 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 8 states. [2019-11-21 21:32:31,769 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:32:32,142 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:32:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:32:38,479 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2019-11-21 21:32:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 21:32:38,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-21 21:32:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:32:38,487 INFO L225 Difference]: With dead ends: 142 [2019-11-21 21:32:38,488 INFO L226 Difference]: Without dead ends: 142 [2019-11-21 21:32:38,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:32:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-21 21:32:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2019-11-21 21:32:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-21 21:32:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2019-11-21 21:32:38,508 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 25 [2019-11-21 21:32:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:32:38,508 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2019-11-21 21:32:38,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 21:32:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2019-11-21 21:32:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 21:32:38,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:32:38,511 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:32:38,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:32:38,714 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:32:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:32:38,714 INFO L82 PathProgramCache]: Analyzing trace with hash -738402624, now seen corresponding path program 1 times [2019-11-21 21:32:38,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:32:38,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [363873401] [2019-11-21 21:32:38,716 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:32:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:32:38,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 21:32:38,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:32:38,824 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:32:38,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:38,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:38,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:32:38,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:32:38,874 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:32:38,875 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:32:38,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:32:38,942 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:32:38,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [363873401] [2019-11-21 21:32:38,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:32:38,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-21 21:32:38,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834156115] [2019-11-21 21:32:38,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 21:32:38,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:32:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 21:32:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 21:32:38,945 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 7 states. [2019-11-21 21:32:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:32:39,338 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2019-11-21 21:32:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 21:32:39,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-21 21:32:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:32:39,343 INFO L225 Difference]: With dead ends: 121 [2019-11-21 21:32:39,343 INFO L226 Difference]: Without dead ends: 121 [2019-11-21 21:32:39,343 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:32:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-21 21:32:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-11-21 21:32:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-21 21:32:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2019-11-21 21:32:39,367 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 26 [2019-11-21 21:32:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:32:39,368 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2019-11-21 21:32:39,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 21:32:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2019-11-21 21:32:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 21:32:39,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:32:39,370 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:32:39,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:32:39,579 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:32:39,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:32:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash -738402623, now seen corresponding path program 1 times [2019-11-21 21:32:39,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:32:39,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1561471878] [2019-11-21 21:32:39,581 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:32:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:32:39,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 21:32:39,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:32:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:32:39,795 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:32:39,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:39,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:39,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:32:39,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 21:32:39,908 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:32:39,908 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:32:40,374 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:32:40,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1561471878] [2019-11-21 21:32:40,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:32:40,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-21 21:32:40,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488123196] [2019-11-21 21:32:40,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 21:32:40,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:32:40,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 21:32:40,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-21 21:32:40,377 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 15 states. [2019-11-21 21:32:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:32:43,447 INFO L93 Difference]: Finished difference Result 271 states and 292 transitions. [2019-11-21 21:32:43,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 21:32:43,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-11-21 21:32:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:32:43,456 INFO L225 Difference]: With dead ends: 271 [2019-11-21 21:32:43,456 INFO L226 Difference]: Without dead ends: 271 [2019-11-21 21:32:43,457 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:32:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-21 21:32:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 139. [2019-11-21 21:32:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-21 21:32:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2019-11-21 21:32:43,486 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 26 [2019-11-21 21:32:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:32:43,487 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2019-11-21 21:32:43,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 21:32:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2019-11-21 21:32:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 21:32:43,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:32:43,489 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:32:43,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:32:43,691 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:32:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:32:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1567288694, now seen corresponding path program 1 times [2019-11-21 21:32:43,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:32:43,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2013231808] [2019-11-21 21:32:43,694 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:32:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:32:43,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 21:32:43,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:32:43,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:32:43,869 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:32:43,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:43,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:43,887 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:32:43,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:43,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:43,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:32:43,900 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-11-21 21:32:43,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:32:43,999 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:32:44,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:44,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:44,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:44,035 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:32:44,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:44,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:44,050 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:32:44,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2019-11-21 21:32:44,236 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:32:44,237 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:32:44,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:32:44,749 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:32:44,755 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:32:44,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:44,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:44,775 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:32:44,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:44,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:44,787 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:32:44,787 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 21:32:45,074 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:32:45,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2013231808] [2019-11-21 21:32:45,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:32:45,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-21 21:32:45,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751653502] [2019-11-21 21:32:45,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 21:32:45,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:32:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 21:32:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-21 21:32:45,077 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 18 states. [2019-11-21 21:32:46,271 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:32:46,930 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:32:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:32:53,373 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2019-11-21 21:32:53,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-21 21:32:53,374 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-21 21:32:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:32:53,378 INFO L225 Difference]: With dead ends: 180 [2019-11-21 21:32:53,378 INFO L226 Difference]: Without dead ends: 180 [2019-11-21 21:32:53,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-11-21 21:32:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-21 21:32:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 141. [2019-11-21 21:32:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-21 21:32:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2019-11-21 21:32:53,390 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 26 [2019-11-21 21:32:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:32:53,391 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2019-11-21 21:32:53,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 21:32:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2019-11-21 21:32:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 21:32:53,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:32:53,393 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:32:53,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:32:53,597 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:32:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:32:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1443420193, now seen corresponding path program 1 times [2019-11-21 21:32:53,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:32:53,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [448484740] [2019-11-21 21:32:53,599 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:32:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:32:53,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 21:32:53,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:32:53,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:32:53,844 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:32:53,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:53,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:53,855 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:32:53,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2019-11-21 21:32:53,986 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:32:53,987 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:32:54,541 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:32:54,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [448484740] [2019-11-21 21:32:54,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:32:54,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2019-11-21 21:32:54,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139956682] [2019-11-21 21:32:54,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-21 21:32:54,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:32:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-21 21:32:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-21 21:32:54,543 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand 19 states. [2019-11-21 21:32:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:32:59,174 INFO L93 Difference]: Finished difference Result 329 states and 360 transitions. [2019-11-21 21:32:59,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-21 21:32:59,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-11-21 21:32:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:32:59,179 INFO L225 Difference]: With dead ends: 329 [2019-11-21 21:32:59,179 INFO L226 Difference]: Without dead ends: 329 [2019-11-21 21:32:59,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2019-11-21 21:32:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-21 21:32:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 171. [2019-11-21 21:32:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-21 21:32:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 190 transitions. [2019-11-21 21:32:59,194 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 190 transitions. Word has length 28 [2019-11-21 21:32:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:32:59,195 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 190 transitions. [2019-11-21 21:32:59,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-21 21:32:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 190 transitions. [2019-11-21 21:32:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 21:32:59,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:32:59,197 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:32:59,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:32:59,400 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:32:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:32:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1041802485, now seen corresponding path program 2 times [2019-11-21 21:32:59,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:32:59,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1320761590] [2019-11-21 21:32:59,402 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:32:59,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 21:32:59,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:32:59,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 21:32:59,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:32:59,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:32:59,615 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:32:59,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:59,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:59,634 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:32:59,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:59,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:59,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:32:59,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2019-11-21 21:32:59,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:59,768 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:32:59,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:59,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:59,789 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:32:59,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:32:59,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:32:59,807 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:32:59,807 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:33 [2019-11-21 21:32:59,989 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:32:59,989 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:33:00,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:33:00,573 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:33:00,579 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:33:00,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:00,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:00,593 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:33:00,594 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:00,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:00,604 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:33:00,605 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 21:33:01,119 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:33:01,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320761590] [2019-11-21 21:33:01,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:33:01,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-11-21 21:33:01,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990110295] [2019-11-21 21:33:01,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-21 21:33:01,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:33:01,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-21 21:33:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2019-11-21 21:33:01,123 INFO L87 Difference]: Start difference. First operand 171 states and 190 transitions. Second operand 24 states. [2019-11-21 21:33:03,519 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:33:04,365 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:33:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:33:14,489 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2019-11-21 21:33:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-21 21:33:14,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2019-11-21 21:33:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:33:14,493 INFO L225 Difference]: With dead ends: 236 [2019-11-21 21:33:14,493 INFO L226 Difference]: Without dead ends: 236 [2019-11-21 21:33:14,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=328, Invalid=1652, Unknown=0, NotChecked=0, Total=1980 [2019-11-21 21:33:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-21 21:33:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 177. [2019-11-21 21:33:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-21 21:33:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2019-11-21 21:33:14,508 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 29 [2019-11-21 21:33:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:33:14,508 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2019-11-21 21:33:14,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-21 21:33:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2019-11-21 21:33:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-21 21:33:14,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:33:14,511 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:33:14,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:33:14,713 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:33:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:33:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1192539356, now seen corresponding path program 1 times [2019-11-21 21:33:14,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:33:14,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1853928747] [2019-11-21 21:33:14,715 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:33:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:33:14,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 21:33:14,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:33:14,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:14,919 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:33:14,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:14,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:14,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:33:14,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-21 21:33:15,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 17 treesize of output 13 [2019-11-21 21:33:15,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:15,061 INFO L567 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2019-11-21 21:33:15,061 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:33:15,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2019-11-21 21:33:15,112 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:33:15,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:33:15,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:15,610 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:33:15,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1853928747] [2019-11-21 21:33:15,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 21:33:15,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-11-21 21:33:15,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108310045] [2019-11-21 21:33:15,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 21:33:15,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:33:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 21:33:15,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:33:15,612 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand 11 states. [2019-11-21 21:33:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:33:16,991 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2019-11-21 21:33:16,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 21:33:16,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-11-21 21:33:16,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:33:16,994 INFO L225 Difference]: With dead ends: 208 [2019-11-21 21:33:16,994 INFO L226 Difference]: Without dead ends: 208 [2019-11-21 21:33:16,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-11-21 21:33:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-21 21:33:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-11-21 21:33:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-21 21:33:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2019-11-21 21:33:17,004 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 30 [2019-11-21 21:33:17,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:33:17,005 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2019-11-21 21:33:17,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 21:33:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2019-11-21 21:33:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 21:33:17,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:33:17,007 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] [2019-11-21 21:33:17,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:33:17,212 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:33:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:33:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1390464367, now seen corresponding path program 1 times [2019-11-21 21:33:17,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:33:17,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1657050934] [2019-11-21 21:33:17,214 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:33:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:33:17,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 21:33:17,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:33:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:17,407 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:33:17,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:17,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:17,424 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:33:17,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:17,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:17,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:33:17,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-11-21 21:33:17,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:33:17,539 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:33:17,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:17,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:17,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:17,567 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:33:17,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:17,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:17,583 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:33:17,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:27 [2019-11-21 21:33:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:33:17,835 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:33:18,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:18,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:33:18,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:33:18,675 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-21 21:33:18,837 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:33:18,847 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:33:18,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:18,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:18,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:33:18,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:18,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:18,885 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:33:18,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 21:33:19,336 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:33:19,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1657050934] [2019-11-21 21:33:19,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:33:19,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-21 21:33:19,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271817137] [2019-11-21 21:33:19,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 21:33:19,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:33:19,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 21:33:19,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:33:19,339 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 21 states. [2019-11-21 21:33:20,461 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:33:21,536 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-21 21:33:22,399 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 21:33:23,527 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-21 21:33:25,011 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-21 21:33:29,613 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:33:31,078 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-21 21:33:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:33:33,585 INFO L93 Difference]: Finished difference Result 376 states and 417 transitions. [2019-11-21 21:33:33,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-21 21:33:33,587 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 31 [2019-11-21 21:33:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:33:33,591 INFO L225 Difference]: With dead ends: 376 [2019-11-21 21:33:33,591 INFO L226 Difference]: Without dead ends: 376 [2019-11-21 21:33:33,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2019-11-21 21:33:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-21 21:33:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 274. [2019-11-21 21:33:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-21 21:33:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 331 transitions. [2019-11-21 21:33:33,608 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 331 transitions. Word has length 31 [2019-11-21 21:33:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:33:33,609 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 331 transitions. [2019-11-21 21:33:33,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 21:33:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 331 transitions. [2019-11-21 21:33:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 21:33:33,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:33:33,611 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:33:33,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:33:33,814 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:33:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:33:33,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1705427517, now seen corresponding path program 1 times [2019-11-21 21:33:33,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:33:33,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [483096690] [2019-11-21 21:33:33,816 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:33:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:33:33,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 21:33:33,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:33:34,085 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:33:34,085 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:33:34,226 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:33:34,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [483096690] [2019-11-21 21:33:34,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 21:33:34,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2019-11-21 21:33:34,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705303892] [2019-11-21 21:33:34,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 21:33:34,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:33:34,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 21:33:34,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-21 21:33:34,227 INFO L87 Difference]: Start difference. First operand 274 states and 331 transitions. Second operand 6 states. [2019-11-21 21:33:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:33:34,366 INFO L93 Difference]: Finished difference Result 299 states and 360 transitions. [2019-11-21 21:33:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 21:33:34,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-21 21:33:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:33:34,369 INFO L225 Difference]: With dead ends: 299 [2019-11-21 21:33:34,369 INFO L226 Difference]: Without dead ends: 299 [2019-11-21 21:33:34,370 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:33:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-21 21:33:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2019-11-21 21:33:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-21 21:33:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 343 transitions. [2019-11-21 21:33:34,381 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 343 transitions. Word has length 32 [2019-11-21 21:33:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:33:34,381 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 343 transitions. [2019-11-21 21:33:34,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 21:33:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 343 transitions. [2019-11-21 21:33:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 21:33:34,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:33:34,383 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:33:34,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:33:34,589 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:33:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:33:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash 154722375, now seen corresponding path program 1 times [2019-11-21 21:33:34,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:33:34,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [738077400] [2019-11-21 21:33:34,590 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:33:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:33:34,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:33:34,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:33:34,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:34,805 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:33:34,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:34,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:34,825 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:33:34,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-11-21 21:33:35,049 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:33:35,050 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:33:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:33:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:36,077 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:33:36,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [738077400] [2019-11-21 21:33:36,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:33:36,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-11-21 21:33:36,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116801686] [2019-11-21 21:33:36,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 21:33:36,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:33:36,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 21:33:36,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-11-21 21:33:36,079 INFO L87 Difference]: Start difference. First operand 283 states and 343 transitions. Second operand 20 states. [2019-11-21 21:33:37,887 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 21:33:38,590 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-21 21:33:39,084 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-21 21:33:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:33:43,261 INFO L93 Difference]: Finished difference Result 383 states and 425 transitions. [2019-11-21 21:33:43,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-21 21:33:43,263 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2019-11-21 21:33:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:33:43,265 INFO L225 Difference]: With dead ends: 383 [2019-11-21 21:33:43,265 INFO L226 Difference]: Without dead ends: 383 [2019-11-21 21:33:43,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2019-11-21 21:33:43,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-21 21:33:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 279. [2019-11-21 21:33:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-21 21:33:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 338 transitions. [2019-11-21 21:33:43,280 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 338 transitions. Word has length 32 [2019-11-21 21:33:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:33:43,280 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 338 transitions. [2019-11-21 21:33:43,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 21:33:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 338 transitions. [2019-11-21 21:33:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 21:33:43,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:33:43,282 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:33:43,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:33:43,485 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:33:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:33:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1012120863, now seen corresponding path program 2 times [2019-11-21 21:33:43,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:33:43,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2093712623] [2019-11-21 21:33:43,486 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:33:43,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 21:33:43,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:33:43,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 21:33:43,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:33:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:43,738 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:33:43,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:43,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:43,747 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:33:43,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2019-11-21 21:33:43,901 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:33:43,901 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:33:44,886 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:33:44,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2093712623] [2019-11-21 21:33:44,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:33:44,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-21 21:33:44,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918882397] [2019-11-21 21:33:44,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-21 21:33:44,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:33:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-21 21:33:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2019-11-21 21:33:44,888 INFO L87 Difference]: Start difference. First operand 279 states and 338 transitions. Second operand 27 states. [2019-11-21 21:33:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:33:52,103 INFO L93 Difference]: Finished difference Result 480 states and 559 transitions. [2019-11-21 21:33:52,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-21 21:33:52,104 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-21 21:33:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:33:52,108 INFO L225 Difference]: With dead ends: 480 [2019-11-21 21:33:52,108 INFO L226 Difference]: Without dead ends: 480 [2019-11-21 21:33:52,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=521, Invalid=2235, Unknown=0, NotChecked=0, Total=2756 [2019-11-21 21:33:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-21 21:33:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 303. [2019-11-21 21:33:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-11-21 21:33:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2019-11-21 21:33:52,123 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 32 [2019-11-21 21:33:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:33:52,124 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2019-11-21 21:33:52,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-21 21:33:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2019-11-21 21:33:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-21 21:33:52,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:33:52,125 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:33:52,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:33:52,328 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:33:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:33:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1956466685, now seen corresponding path program 1 times [2019-11-21 21:33:52,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:33:52,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1692998611] [2019-11-21 21:33:52,330 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:33:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:33:52,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 21:33:52,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:33:52,525 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:33:52,525 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:33:52,759 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:33:52,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1692998611] [2019-11-21 21:33:52,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:33:52,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-21 21:33:52,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403735056] [2019-11-21 21:33:52,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 21:33:52,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:33:52,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 21:33:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-21 21:33:52,762 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 14 states. [2019-11-21 21:33:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:33:53,215 INFO L93 Difference]: Finished difference Result 359 states and 428 transitions. [2019-11-21 21:33:53,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 21:33:53,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-21 21:33:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:33:53,218 INFO L225 Difference]: With dead ends: 359 [2019-11-21 21:33:53,218 INFO L226 Difference]: Without dead ends: 359 [2019-11-21 21:33:53,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-21 21:33:53,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-21 21:33:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 311. [2019-11-21 21:33:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-21 21:33:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 380 transitions. [2019-11-21 21:33:53,237 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 380 transitions. Word has length 34 [2019-11-21 21:33:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:33:53,238 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 380 transitions. [2019-11-21 21:33:53,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 21:33:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 380 transitions. [2019-11-21 21:33:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-21 21:33:53,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:33:53,240 INFO L410 BasicCegarLoop]: trace histogram [4, 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:33:53,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:33:53,443 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:33:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:33:53,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1264518628, now seen corresponding path program 2 times [2019-11-21 21:33:53,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:33:53,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1868583435] [2019-11-21 21:33:53,445 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 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:33:53,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 21:33:53,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:33:53,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 21:33:53,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:33:53,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:53,768 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:33:53,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:53,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:53,790 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:33:53,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:53,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:53,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:33:53,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2019-11-21 21:33:53,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:53,931 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:33:53,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:53,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:53,952 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:33:53,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:53,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:53,970 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:33:53,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:33 [2019-11-21 21:33:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:33:54,412 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:33:55,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:33:55,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:33:55,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:33:55,574 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-21 21:33:55,813 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:33:55,824 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:33:55,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:55,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:55,847 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:33:55,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:33:55,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:33:55,865 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:33:55,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 21:33:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:33:56,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1868583435] [2019-11-21 21:33:56,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:33:56,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-21 21:33:56,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901264469] [2019-11-21 21:33:56,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-21 21:33:56,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:33:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-21 21:33:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-11-21 21:33:56,592 INFO L87 Difference]: Start difference. First operand 311 states and 380 transitions. Second operand 27 states. [2019-11-21 21:33:58,253 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:34:00,269 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-21 21:34:01,400 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 21:34:02,755 WARN L192 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-21 21:34:04,142 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-21 21:34:05,629 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-21 21:34:09,177 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:34:12,101 WARN L192 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-11-21 21:34:12,804 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-21 21:34:14,913 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 21:34:15,590 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-21 21:34:15,947 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 21:34:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:34:16,330 INFO L93 Difference]: Finished difference Result 525 states and 610 transitions. [2019-11-21 21:34:16,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-21 21:34:16,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-11-21 21:34:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:34:16,333 INFO L225 Difference]: With dead ends: 525 [2019-11-21 21:34:16,333 INFO L226 Difference]: Without dead ends: 525 [2019-11-21 21:34:16,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=482, Invalid=2710, Unknown=0, NotChecked=0, Total=3192 [2019-11-21 21:34:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-21 21:34:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 317. [2019-11-21 21:34:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-11-21 21:34:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 387 transitions. [2019-11-21 21:34:16,347 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 387 transitions. Word has length 34 [2019-11-21 21:34:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:34:16,347 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 387 transitions. [2019-11-21 21:34:16,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-21 21:34:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 387 transitions. [2019-11-21 21:34:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 21:34:16,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:34:16,349 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:34:16,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:34:16,552 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:34:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:34:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1772696709, now seen corresponding path program 1 times [2019-11-21 21:34:16,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:34:16,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [639103421] [2019-11-21 21:34:16,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:34:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:34:16,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 21:34:16,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:34:16,765 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:34:16,765 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:34:17,164 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:34:17,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639103421] [2019-11-21 21:34:17,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:34:17,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-21 21:34:17,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956406083] [2019-11-21 21:34:17,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 21:34:17,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:34:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 21:34:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-21 21:34:17,166 INFO L87 Difference]: Start difference. First operand 317 states and 387 transitions. Second operand 16 states. [2019-11-21 21:34:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:34:17,930 INFO L93 Difference]: Finished difference Result 386 states and 461 transitions. [2019-11-21 21:34:17,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-21 21:34:17,931 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-11-21 21:34:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:34:17,933 INFO L225 Difference]: With dead ends: 386 [2019-11-21 21:34:17,933 INFO L226 Difference]: Without dead ends: 386 [2019-11-21 21:34:17,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:34:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-11-21 21:34:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 329. [2019-11-21 21:34:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-21 21:34:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 395 transitions. [2019-11-21 21:34:17,944 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 395 transitions. Word has length 37 [2019-11-21 21:34:17,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:34:17,944 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 395 transitions. [2019-11-21 21:34:17,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 21:34:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 395 transitions. [2019-11-21 21:34:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 21:34:17,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:34:17,946 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:34:18,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:34:18,148 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 21:34:18,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:34:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 545371762, now seen corresponding path program 2 times [2019-11-21 21:34:18,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:34:18,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1850887379] [2019-11-21 21:34:18,150 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 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 21:34:18,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 21:34:18,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:34:18,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-21 21:34:18,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:34:18,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:34:18,433 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:34:18,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:18,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:18,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:34:18,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2019-11-21 21:34:18,844 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:34:18,844 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:34:20,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:34:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 21:34:20,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 21:34:20,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 21:34:20,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:34:21,110 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:34:21,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1850887379] [2019-11-21 21:34:21,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:34:21,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2019-11-21 21:34:21,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212117939] [2019-11-21 21:34:21,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-21 21:34:21,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:34:21,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-21 21:34:21,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-11-21 21:34:21,113 INFO L87 Difference]: Start difference. First operand 329 states and 395 transitions. Second operand 31 states. [2019-11-21 21:34:25,373 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-21 21:34:26,233 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-11-21 21:34:26,892 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-21 21:34:27,523 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:34:27,942 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 21:34:28,931 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-11-21 21:34:29,719 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-21 21:34:30,332 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 21:34:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:34:34,921 INFO L93 Difference]: Finished difference Result 446 states and 515 transitions. [2019-11-21 21:34:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-21 21:34:34,923 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 35 [2019-11-21 21:34:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:34:34,925 INFO L225 Difference]: With dead ends: 446 [2019-11-21 21:34:34,925 INFO L226 Difference]: Without dead ends: 446 [2019-11-21 21:34:34,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=472, Invalid=2608, Unknown=0, NotChecked=0, Total=3080 [2019-11-21 21:34:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-21 21:34:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 314. [2019-11-21 21:34:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-21 21:34:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 377 transitions. [2019-11-21 21:34:34,945 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 377 transitions. Word has length 35 [2019-11-21 21:34:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:34:34,945 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 377 transitions. [2019-11-21 21:34:34,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-21 21:34:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 377 transitions. [2019-11-21 21:34:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 21:34:34,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:34:34,949 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 21:34:35,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:34:35,152 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 21:34:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:34:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1450357547, now seen corresponding path program 3 times [2019-11-21 21:34:35,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:34:35,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [521900205] [2019-11-21 21:34:35,154 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 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 21:34:35,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-21 21:34:35,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:34:35,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 21:34:35,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:34:35,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:34:35,508 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:34:35,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:35,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:35,526 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:34:35,527 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:35,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:35,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:34:35,541 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:39 [2019-11-21 21:34:35,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:34:35,736 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:34:35,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:35,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:35,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:35,775 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:34:35,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:35,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:35,793 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:34:35,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:45 [2019-11-21 21:34:36,120 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 21:34:36,120 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:34:36,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:34:36,887 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:34:36,895 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:34:36,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:36,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:36,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:34:36,909 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:36,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:36,919 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:34:36,919 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 21:34:38,185 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 21:34:38,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [521900205] [2019-11-21 21:34:38,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:34:38,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2019-11-21 21:34:38,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617788416] [2019-11-21 21:34:38,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-21 21:34:38,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:34:38,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-21 21:34:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2019-11-21 21:34:38,187 INFO L87 Difference]: Start difference. First operand 314 states and 377 transitions. Second operand 36 states. [2019-11-21 21:34:40,836 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:34:41,527 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 21:34:42,133 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 21:34:43,519 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:34:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:34:49,679 INFO L93 Difference]: Finished difference Result 390 states and 462 transitions. [2019-11-21 21:34:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-21 21:34:49,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-11-21 21:34:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:34:49,683 INFO L225 Difference]: With dead ends: 390 [2019-11-21 21:34:49,683 INFO L226 Difference]: Without dead ends: 390 [2019-11-21 21:34:49,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1098, Invalid=4304, Unknown=0, NotChecked=0, Total=5402 [2019-11-21 21:34:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-21 21:34:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 345. [2019-11-21 21:34:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-11-21 21:34:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 417 transitions. [2019-11-21 21:34:49,696 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 417 transitions. Word has length 35 [2019-11-21 21:34:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:34:49,696 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 417 transitions. [2019-11-21 21:34:49,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-21 21:34:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 417 transitions. [2019-11-21 21:34:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-21 21:34:49,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:34:49,698 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 21:34:49,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:34:49,901 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 21:34:49,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:34:49,901 INFO L82 PathProgramCache]: Analyzing trace with hash 94312874, now seen corresponding path program 3 times [2019-11-21 21:34:49,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:34:49,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [599755268] [2019-11-21 21:34:49,902 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 21:34:50,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-21 21:34:50,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:34:50,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-21 21:34:50,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:34:50,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:34:50,195 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:34:50,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:50,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:34:50,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:34:50,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2019-11-21 21:34:50,436 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:34:50,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:34:50,456 INFO L567 ElimStorePlain]: treesize reduction 18, result has 43.8 percent of original size [2019-11-21 21:34:50,457 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:34:50,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:14 [2019-11-21 21:34:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:34:50,510 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:34:51,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 21:34:51,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:34:51,626 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 21:34:51,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [599755268] [2019-11-21 21:34:51,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:34:51,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-11-21 21:34:51,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65191921] [2019-11-21 21:34:51,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-21 21:34:51,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:34:51,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-21 21:34:51,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-11-21 21:34:51,628 INFO L87 Difference]: Start difference. First operand 345 states and 417 transitions. Second operand 26 states. [2019-11-21 21:34:53,562 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-21 21:34:54,455 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 21:34:54,904 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 21:34:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:34:58,620 INFO L93 Difference]: Finished difference Result 446 states and 524 transitions. [2019-11-21 21:34:58,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-21 21:34:58,621 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-11-21 21:34:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:34:58,628 INFO L225 Difference]: With dead ends: 446 [2019-11-21 21:34:58,628 INFO L226 Difference]: Without dead ends: 446 [2019-11-21 21:34:58,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2019-11-21 21:34:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-21 21:34:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 350. [2019-11-21 21:34:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-21 21:34:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 422 transitions. [2019-11-21 21:34:58,642 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 422 transitions. Word has length 36 [2019-11-21 21:34:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:34:58,643 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 422 transitions. [2019-11-21 21:34:58,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-21 21:34:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 422 transitions. [2019-11-21 21:34:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-21 21:34:58,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:34:58,644 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 21:34:58,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:34:58,848 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 21:34:58,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:34:58,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1947825803, now seen corresponding path program 1 times [2019-11-21 21:34:58,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:34:58,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [424686178] [2019-11-21 21:34:58,849 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 21:34:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:34:58,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:34:58,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:34:58,994 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 21:34:58,994 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:34:59,013 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 21:34:59,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [424686178] [2019-11-21 21:34:59,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:34:59,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 21:34:59,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341085693] [2019-11-21 21:34:59,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 21:34:59,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:34:59,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 21:34:59,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 21:34:59,015 INFO L87 Difference]: Start difference. First operand 350 states and 422 transitions. Second operand 6 states. [2019-11-21 21:34:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:34:59,360 INFO L93 Difference]: Finished difference Result 345 states and 410 transitions. [2019-11-21 21:34:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 21:34:59,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-11-21 21:34:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:34:59,363 INFO L225 Difference]: With dead ends: 345 [2019-11-21 21:34:59,363 INFO L226 Difference]: Without dead ends: 345 [2019-11-21 21:34:59,363 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 21:34:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-11-21 21:34:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 344. [2019-11-21 21:34:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-21 21:34:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 410 transitions. [2019-11-21 21:34:59,371 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 410 transitions. Word has length 39 [2019-11-21 21:34:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:34:59,371 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 410 transitions. [2019-11-21 21:34:59,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 21:34:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 410 transitions. [2019-11-21 21:34:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-21 21:34:59,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:34:59,373 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 21:34:59,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:34:59,574 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 21:34:59,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:34:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1947825804, now seen corresponding path program 1 times [2019-11-21 21:34:59,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:34:59,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1842567870] [2019-11-21 21:34:59,576 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 21:34:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:34:59,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 21:34:59,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:34:59,951 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:34:59,951 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:35:00,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:35:00,591 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 21:35:00,591 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 21:35:00,613 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 21:35:00,614 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 21:35:00,642 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 21:35:00,643 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 21:35:00,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:00,737 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 21:35:00,737 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:81, output treesize:73 [2019-11-21 21:35:01,074 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-21 21:35:01,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:35:01,680 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2019-11-21 21:35:02,031 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:35:02,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1842567870] [2019-11-21 21:35:02,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:35:02,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-21 21:35:02,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382828750] [2019-11-21 21:35:02,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 21:35:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:35:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 21:35:02,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:35:02,033 INFO L87 Difference]: Start difference. First operand 344 states and 410 transitions. Second operand 21 states. [2019-11-21 21:35:03,492 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-21 21:35:04,020 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-11-21 21:35:04,932 WARN L192 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-21 21:35:06,900 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 21:35:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:35:09,434 INFO L93 Difference]: Finished difference Result 411 states and 481 transitions. [2019-11-21 21:35:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 21:35:09,436 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-11-21 21:35:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:35:09,438 INFO L225 Difference]: With dead ends: 411 [2019-11-21 21:35:09,438 INFO L226 Difference]: Without dead ends: 411 [2019-11-21 21:35:09,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2019-11-21 21:35:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-21 21:35:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 289. [2019-11-21 21:35:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-21 21:35:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 331 transitions. [2019-11-21 21:35:09,446 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 331 transitions. Word has length 39 [2019-11-21 21:35:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:35:09,447 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 331 transitions. [2019-11-21 21:35:09,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 21:35:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 331 transitions. [2019-11-21 21:35:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-21 21:35:09,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:35:09,448 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-21 21:35:09,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:35:09,652 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 21:35:09,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:35:09,652 INFO L82 PathProgramCache]: Analyzing trace with hash -44140619, now seen corresponding path program 4 times [2019-11-21 21:35:09,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:35:09,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [724054791] [2019-11-21 21:35:09,653 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 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 21:35:09,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-21 21:35:09,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:35:09,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 21:35:09,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:35:09,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:35:09,884 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:35:09,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:09,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:09,901 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:35:09,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:09,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:09,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:35:09,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2019-11-21 21:35:10,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:35:10,002 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:35:10,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:10,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:10,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:10,032 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:35:10,033 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:10,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:10,050 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:35:10,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-11-21 21:35:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:35:10,370 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:35:11,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:35:11,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:35:11,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:35:11,576 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:35:11,587 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:35:11,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:11,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:11,604 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:35:11,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:11,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:11,622 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:35:11,622 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 21:35:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:35:12,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724054791] [2019-11-21 21:35:12,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:35:12,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2019-11-21 21:35:12,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037720385] [2019-11-21 21:35:12,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-21 21:35:12,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:35:12,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-21 21:35:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-11-21 21:35:12,162 INFO L87 Difference]: Start difference. First operand 289 states and 331 transitions. Second operand 25 states. [2019-11-21 21:35:15,179 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 21:35:16,228 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-21 21:35:17,549 WARN L192 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-11-21 21:35:18,868 WARN L192 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-11-21 21:35:20,009 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 21:35:24,782 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-21 21:35:29,174 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-21 21:35:29,575 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 21:35:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:35:29,705 INFO L93 Difference]: Finished difference Result 466 states and 521 transitions. [2019-11-21 21:35:29,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-21 21:35:29,706 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2019-11-21 21:35:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:35:29,707 INFO L225 Difference]: With dead ends: 466 [2019-11-21 21:35:29,707 INFO L226 Difference]: Without dead ends: 466 [2019-11-21 21:35:29,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=364, Invalid=2086, Unknown=0, NotChecked=0, Total=2450 [2019-11-21 21:35:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-21 21:35:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 322. [2019-11-21 21:35:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-21 21:35:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 365 transitions. [2019-11-21 21:35:29,716 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 365 transitions. Word has length 37 [2019-11-21 21:35:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:35:29,716 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 365 transitions. [2019-11-21 21:35:29,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-21 21:35:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 365 transitions. [2019-11-21 21:35:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-21 21:35:29,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:35:29,718 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 21:35:29,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:35:29,921 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 21:35:29,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:35:29,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1368359231, now seen corresponding path program 3 times [2019-11-21 21:35:29,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:35:29,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [659793857] [2019-11-21 21:35:29,922 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 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 21:35:30,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-21 21:35:30,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:35:30,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-21 21:35:30,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:35:30,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:35:30,153 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:35:30,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:30,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:30,177 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:35:30,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:30,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:30,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:35:30,195 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:37 [2019-11-21 21:35:30,291 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:30,291 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:35:30,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:30,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:30,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 21:35:30,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:30,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:30,347 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:35:30,348 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:46 [2019-11-21 21:35:31,043 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 21:35:31,043 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:35:31,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:35:32,347 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-21 21:35:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:35:36,107 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:35:36,109 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:35:36,110 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 21:35:36,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:35:36,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:35:36,112 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-21 21:35:36,112 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 21:35:36,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:88, output treesize:1 [2019-11-21 21:35:36,185 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 21:35:36,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [659793857] [2019-11-21 21:35:36,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:35:36,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 20 [2019-11-21 21:35:36,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335221983] [2019-11-21 21:35:36,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 21:35:36,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:35:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 21:35:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:35:36,187 INFO L87 Difference]: Start difference. First operand 322 states and 365 transitions. Second operand 21 states. [2019-11-21 21:35:39,339 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-11-21 21:35:41,839 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-11-21 21:35:42,406 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 21:35:45,714 WARN L192 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 126 DAG size of output: 123 [2019-11-21 21:35:50,392 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 132 [2019-11-21 21:35:52,422 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 21:35:52,972 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-11-21 21:36:06,743 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 82 [2019-11-21 21:36:12,465 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-21 21:36:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:36:15,344 INFO L93 Difference]: Finished difference Result 403 states and 450 transitions. [2019-11-21 21:36:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-21 21:36:15,348 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2019-11-21 21:36:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:36:15,350 INFO L225 Difference]: With dead ends: 403 [2019-11-21 21:36:15,350 INFO L226 Difference]: Without dead ends: 403 [2019-11-21 21:36:15,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2019-11-21 21:36:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-11-21 21:36:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 372. [2019-11-21 21:36:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-21 21:36:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 435 transitions. [2019-11-21 21:36:15,358 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 435 transitions. Word has length 38 [2019-11-21 21:36:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:36:15,358 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 435 transitions. [2019-11-21 21:36:15,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 21:36:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 435 transitions. [2019-11-21 21:36:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 21:36:15,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:36:15,360 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 21:36:15,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:36:15,563 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 21:36:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:36:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1910871165, now seen corresponding path program 1 times [2019-11-21 21:36:15,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:36:15,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1738400922] [2019-11-21 21:36:15,563 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 21:36:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:36:15,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:36:15,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:36:15,718 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 21:36:15,718 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:36:15,734 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 21:36:15,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1738400922] [2019-11-21 21:36:15,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:36:15,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 21:36:15,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651250157] [2019-11-21 21:36:15,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 21:36:15,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:36:15,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 21:36:15,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 21:36:15,736 INFO L87 Difference]: Start difference. First operand 372 states and 435 transitions. Second operand 5 states. [2019-11-21 21:36:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:36:15,993 INFO L93 Difference]: Finished difference Result 370 states and 429 transitions. [2019-11-21 21:36:15,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 21:36:15,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-11-21 21:36:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:36:15,996 INFO L225 Difference]: With dead ends: 370 [2019-11-21 21:36:15,997 INFO L226 Difference]: Without dead ends: 370 [2019-11-21 21:36:15,997 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 21:36:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-21 21:36:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-11-21 21:36:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-11-21 21:36:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 429 transitions. [2019-11-21 21:36:16,005 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 429 transitions. Word has length 40 [2019-11-21 21:36:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:36:16,005 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 429 transitions. [2019-11-21 21:36:16,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 21:36:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 429 transitions. [2019-11-21 21:36:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 21:36:16,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:36:16,007 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 21:36:16,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:36:16,210 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 21:36:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:36:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1910871164, now seen corresponding path program 1 times [2019-11-21 21:36:16,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:36:16,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1031134455] [2019-11-21 21:36:16,211 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 21:36:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:36:16,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:36:16,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:36:16,575 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 21:36:16,575 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:36:17,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:36:17,247 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 21:36:17,248 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 21:36:17,268 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 21:36:17,269 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 21:36:17,294 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 21:36:17,295 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 21:36:17,398 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-21 21:36:17,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:36:17,398 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 21:36:17,399 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:71 [2019-11-21 21:36:17,855 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2019-11-21 21:36:18,016 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 21:36:18,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1031134455] [2019-11-21 21:36:18,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:36:18,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-11-21 21:36:18,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863493727] [2019-11-21 21:36:18,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 21:36:18,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:36:18,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 21:36:18,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-11-21 21:36:18,018 INFO L87 Difference]: Start difference. First operand 369 states and 429 transitions. Second operand 20 states. [2019-11-21 21:36:20,211 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-21 21:36:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:36:22,834 INFO L93 Difference]: Finished difference Result 498 states and 590 transitions. [2019-11-21 21:36:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 21:36:22,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-11-21 21:36:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:36:22,839 INFO L225 Difference]: With dead ends: 498 [2019-11-21 21:36:22,839 INFO L226 Difference]: Without dead ends: 498 [2019-11-21 21:36:22,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2019-11-21 21:36:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-21 21:36:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 393. [2019-11-21 21:36:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-21 21:36:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 469 transitions. [2019-11-21 21:36:22,849 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 469 transitions. Word has length 40 [2019-11-21 21:36:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:36:22,850 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 469 transitions. [2019-11-21 21:36:22,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 21:36:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 469 transitions. [2019-11-21 21:36:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-21 21:36:22,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:36:22,852 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 21:36:23,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:36:23,054 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 21:36:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:36:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash 892536140, now seen corresponding path program 1 times [2019-11-21 21:36:23,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:36:23,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [461250444] [2019-11-21 21:36:23,055 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 21:36:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:36:23,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-21 21:36:23,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:36:23,528 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 21:36:23,528 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:36:25,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:36:25,061 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 21:36:25,062 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 21:36:25,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2019-11-21 21:36:25,078 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 21:36:25,103 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 21:36:25,104 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 21:36:25,348 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2019-11-21 21:36:25,348 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.6 percent of original size [2019-11-21 21:36:25,349 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 21:36:25,349 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:113, output treesize:75 [2019-11-21 21:36:25,939 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2019-11-21 21:36:26,199 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 21:36:26,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [461250444] [2019-11-21 21:36:26,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:36:26,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-21 21:36:26,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834586216] [2019-11-21 21:36:26,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-21 21:36:26,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:36:26,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-21 21:36:26,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2019-11-21 21:36:26,200 INFO L87 Difference]: Start difference. First operand 393 states and 469 transitions. Second operand 24 states. [2019-11-21 21:36:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:36:32,982 INFO L93 Difference]: Finished difference Result 491 states and 587 transitions. [2019-11-21 21:36:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 21:36:32,983 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2019-11-21 21:36:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:36:32,986 INFO L225 Difference]: With dead ends: 491 [2019-11-21 21:36:32,986 INFO L226 Difference]: Without dead ends: 491 [2019-11-21 21:36:32,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=242, Invalid=1240, Unknown=0, NotChecked=0, Total=1482 [2019-11-21 21:36:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-11-21 21:36:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 394. [2019-11-21 21:36:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-11-21 21:36:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 467 transitions. [2019-11-21 21:36:32,996 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 467 transitions. Word has length 41 [2019-11-21 21:36:32,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:36:32,996 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 467 transitions. [2019-11-21 21:36:32,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-21 21:36:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 467 transitions. [2019-11-21 21:36:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 21:36:32,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:36:32,998 INFO L410 BasicCegarLoop]: trace histogram [10, 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:36:33,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:36:33,202 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 21:36:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:36:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1610107396, now seen corresponding path program 5 times [2019-11-21 21:36:33,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:36:33,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1434456400] [2019-11-21 21:36:33,203 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 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 21:36:33,352 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-21 21:36:33,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:36:33,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-21 21:36:33,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:36:33,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:36:33,581 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:36:33,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:36:33,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:36:33,602 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:36:33,602 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:36:33,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:36:33,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:36:33,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:39 [2019-11-21 21:36:33,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:36:33,789 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:36:33,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:36:33,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:36:33,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:36:33,828 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:36:33,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:36:33,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:36:33,852 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:36:33,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:48 [2019-11-21 21:36:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 21:36:34,505 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:36:35,850 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-11-21 21:36:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:36:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 21:36:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 21:36:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:36:36,500 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-11-21 21:36:36,738 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:36:36,746 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:36:36,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:36:36,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:36:36,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:36:36,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:36:36,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:36:36,785 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:36:36,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:15 [2019-11-21 21:36:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 21:36:38,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1434456400] [2019-11-21 21:36:38,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:36:38,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2019-11-21 21:36:38,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624753765] [2019-11-21 21:36:38,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-21 21:36:38,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:36:38,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-21 21:36:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2019-11-21 21:36:38,934 INFO L87 Difference]: Start difference. First operand 394 states and 467 transitions. Second operand 41 states. [2019-11-21 21:36:44,465 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 21:36:45,016 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-21 21:36:45,592 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 21:36:45,959 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 21:36:47,793 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-21 21:36:49,831 WARN L192 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-21 21:36:51,150 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-21 21:36:52,999 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-21 21:36:55,561 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-21 21:36:58,422 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-11-21 21:37:01,828 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2019-11-21 21:37:02,749 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-21 21:37:04,257 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 21:37:04,614 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-21 21:37:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:37:05,206 INFO L93 Difference]: Finished difference Result 597 states and 691 transitions. [2019-11-21 21:37:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-11-21 21:37:05,206 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-11-21 21:37:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:37:05,209 INFO L225 Difference]: With dead ends: 597 [2019-11-21 21:37:05,209 INFO L226 Difference]: Without dead ends: 597 [2019-11-21 21:37:05,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=962, Invalid=5844, Unknown=0, NotChecked=0, Total=6806 [2019-11-21 21:37:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-21 21:37:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 371. [2019-11-21 21:37:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-11-21 21:37:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 443 transitions. [2019-11-21 21:37:05,219 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 443 transitions. Word has length 40 [2019-11-21 21:37:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:37:05,220 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 443 transitions. [2019-11-21 21:37:05,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-21 21:37:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 443 transitions. [2019-11-21 21:37:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 21:37:05,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:37:05,221 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 21:37:05,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:37:05,424 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 21:37:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:37:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash 738785377, now seen corresponding path program 3 times [2019-11-21 21:37:05,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:37:05,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [114806621] [2019-11-21 21:37:05,426 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 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 21:37:05,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-21 21:37:05,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:37:05,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 21:37:05,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:37:05,582 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:37:05,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:05,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:05,599 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:37:05,599 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:05,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:05,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:37:05,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2019-11-21 21:37:05,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:37:05,683 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:37:05,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:05,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:05,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:05,717 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:37:05,717 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:05,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:05,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:37:05,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2019-11-21 21:37:14,304 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-21 21:37:14,481 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 21:37:14,481 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:37:18,910 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-21 21:37:19,290 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-21 21:37:19,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:37:19,783 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:37:19,787 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:37:19,791 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 21:37:19,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:19,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:19,792 INFO L464 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-21 21:37:19,792 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 21:37:19,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:1 [2019-11-21 21:37:19,816 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 21:37:19,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [114806621] [2019-11-21 21:37:19,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 21:37:19,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2019-11-21 21:37:19,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969432984] [2019-11-21 21:37:19,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 21:37:19,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:37:19,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 21:37:19,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=245, Unknown=4, NotChecked=0, Total=306 [2019-11-21 21:37:19,818 INFO L87 Difference]: Start difference. First operand 371 states and 443 transitions. Second operand 7 states. [2019-11-21 21:37:20,295 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 21:37:22,992 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-21 21:37:25,601 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-21 21:37:26,034 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-21 21:37:31,329 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-11-21 21:37:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:37:31,652 INFO L93 Difference]: Finished difference Result 371 states and 441 transitions. [2019-11-21 21:37:31,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 21:37:31,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-21 21:37:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:37:31,656 INFO L225 Difference]: With dead ends: 371 [2019-11-21 21:37:31,656 INFO L226 Difference]: Without dead ends: 371 [2019-11-21 21:37:31,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=92, Invalid=408, Unknown=6, NotChecked=0, Total=506 [2019-11-21 21:37:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-21 21:37:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2019-11-21 21:37:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-11-21 21:37:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 428 transitions. [2019-11-21 21:37:31,666 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 428 transitions. Word has length 40 [2019-11-21 21:37:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:37:31,666 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 428 transitions. [2019-11-21 21:37:31,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 21:37:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 428 transitions. [2019-11-21 21:37:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-21 21:37:31,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:37:31,668 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 21:37:31,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:37:31,871 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 21:37:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:37:31,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1177127925, now seen corresponding path program 1 times [2019-11-21 21:37:31,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:37:31,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1578939297] [2019-11-21 21:37:31,873 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 21:37:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:37:32,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 21:37:32,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:37:32,063 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 21:37:32,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:37:34,627 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 21:37:34,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1578939297] [2019-11-21 21:37:34,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:37:34,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-21 21:37:34,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186369749] [2019-11-21 21:37:34,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 21:37:34,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:37:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 21:37:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-21 21:37:34,629 INFO L87 Difference]: Start difference. First operand 359 states and 428 transitions. Second operand 16 states. [2019-11-21 21:37:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:37:36,234 INFO L93 Difference]: Finished difference Result 401 states and 470 transitions. [2019-11-21 21:37:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 21:37:36,241 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-11-21 21:37:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:37:36,243 INFO L225 Difference]: With dead ends: 401 [2019-11-21 21:37:36,243 INFO L226 Difference]: Without dead ends: 401 [2019-11-21 21:37:36,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-21 21:37:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-11-21 21:37:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 381. [2019-11-21 21:37:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-21 21:37:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 450 transitions. [2019-11-21 21:37:36,249 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 450 transitions. Word has length 43 [2019-11-21 21:37:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:37:36,250 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 450 transitions. [2019-11-21 21:37:36,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 21:37:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 450 transitions. [2019-11-21 21:37:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-21 21:37:36,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:37:36,251 INFO L410 BasicCegarLoop]: trace histogram [6, 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 21:37:36,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:37:36,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 21:37:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:37:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash -687397643, now seen corresponding path program 6 times [2019-11-21 21:37:36,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:37:36,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [601228993] [2019-11-21 21:37:36,455 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 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 21:37:36,607 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-21 21:37:36,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:37:36,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-21 21:37:36,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:37:36,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 8 treesize of output 7 [2019-11-21 21:37:36,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:36,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:36,664 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:37:36,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:36,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:36,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:37:36,681 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2019-11-21 21:37:36,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:36,748 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:37:36,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:36,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:36,778 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:37:36,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:37:36,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:37:36,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:37:36,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:36 [2019-11-21 21:37:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-21 21:37:49,417 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:37:56,999 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-11-21 21:37:59,347 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-21 21:38:01,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-21 21:38:01,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:38:01,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:38:02,034 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-21 21:38:02,243 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:38:02,249 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:38:02,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:38:02,285 INFO L567 ElimStorePlain]: treesize reduction 16, result has 64.4 percent of original size [2019-11-21 21:38:02,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:38:02,288 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:38:02,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:38:02,304 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:38:02,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:16 [2019-11-21 21:38:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-21 21:38:02,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [601228993] [2019-11-21 21:38:02,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:38:02,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 24 [2019-11-21 21:38:02,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078533585] [2019-11-21 21:38:02,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-21 21:38:02,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:38:02,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-21 21:38:02,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=468, Unknown=11, NotChecked=0, Total=600 [2019-11-21 21:38:02,556 INFO L87 Difference]: Start difference. First operand 381 states and 450 transitions. Second operand 25 states. [2019-11-21 21:38:15,452 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:38:22,898 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-21 21:38:28,336 WARN L192 SmtUtils]: Spent 918.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 21:38:29,364 WARN L192 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-21 21:38:31,504 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2019-11-21 21:38:31,841 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-11-21 21:38:33,013 WARN L192 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-21 21:38:34,107 WARN L192 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-21 21:38:38,922 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-21 21:38:40,868 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-11-21 21:38:45,747 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-21 21:38:47,165 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-11-21 21:38:47,673 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-21 21:38:48,526 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-21 21:39:00,316 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 21:39:03,820 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-11-21 21:39:06,894 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-21 21:39:21,820 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-21 21:39:22,929 WARN L192 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2019-11-21 21:39:27,659 WARN L192 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2019-11-21 21:39:35,477 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-21 21:39:43,100 WARN L192 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-21 21:39:45,727 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 111 DAG size of output: 104 [2019-11-21 21:39:47,973 WARN L192 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-11-21 21:39:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:39:48,198 INFO L93 Difference]: Finished difference Result 612 states and 740 transitions. [2019-11-21 21:39:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-21 21:39:48,201 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41 [2019-11-21 21:39:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:39:48,203 INFO L225 Difference]: With dead ends: 612 [2019-11-21 21:39:48,203 INFO L226 Difference]: Without dead ends: 612 [2019-11-21 21:39:48,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=774, Invalid=2292, Unknown=14, NotChecked=0, Total=3080 [2019-11-21 21:39:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-11-21 21:39:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 363. [2019-11-21 21:39:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-21 21:39:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 434 transitions. [2019-11-21 21:39:48,213 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 434 transitions. Word has length 41 [2019-11-21 21:39:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:39:48,214 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 434 transitions. [2019-11-21 21:39:48,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-21 21:39:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 434 transitions. [2019-11-21 21:39:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-21 21:39:48,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:39:48,215 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 21:39:48,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:39:48,418 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 21:39:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:39:48,419 INFO L82 PathProgramCache]: Analyzing trace with hash -643947105, now seen corresponding path program 1 times [2019-11-21 21:39:48,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:39:48,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [965980787] [2019-11-21 21:39:48,420 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 21:39:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:39:48,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 21:39:48,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:39:48,730 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 21:39:48,730 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:39:49,006 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 21:39:49,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [965980787] [2019-11-21 21:39:49,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:39:49,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-11-21 21:39:49,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128735239] [2019-11-21 21:39:49,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 21:39:49,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:39:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 21:39:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:39:49,007 INFO L87 Difference]: Start difference. First operand 363 states and 434 transitions. Second operand 21 states. [2019-11-21 21:39:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:39:50,618 INFO L93 Difference]: Finished difference Result 438 states and 511 transitions. [2019-11-21 21:39:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-21 21:39:50,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-11-21 21:39:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:39:50,622 INFO L225 Difference]: With dead ends: 438 [2019-11-21 21:39:50,622 INFO L226 Difference]: Without dead ends: 438 [2019-11-21 21:39:50,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2019-11-21 21:39:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-21 21:39:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 388. [2019-11-21 21:39:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-21 21:39:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 465 transitions. [2019-11-21 21:39:50,628 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 465 transitions. Word has length 44 [2019-11-21 21:39:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:39:50,629 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 465 transitions. [2019-11-21 21:39:50,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 21:39:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 465 transitions. [2019-11-21 21:39:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 21:39:50,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:39:50,630 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 21:39:50,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:39:50,833 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 21:39:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:39:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2041306870, now seen corresponding path program 1 times [2019-11-21 21:39:50,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:39:50,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [128186199] [2019-11-21 21:39:50,835 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 21:39:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:39:50,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 21:39:50,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:39:51,017 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 21:39:51,017 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:39:51,030 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 21:39:51,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [128186199] [2019-11-21 21:39:51,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:39:51,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 21:39:51,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242043682] [2019-11-21 21:39:51,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 21:39:51,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:39:51,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 21:39:51,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 21:39:51,032 INFO L87 Difference]: Start difference. First operand 388 states and 465 transitions. Second operand 6 states. [2019-11-21 21:39:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:39:51,309 INFO L93 Difference]: Finished difference Result 388 states and 463 transitions. [2019-11-21 21:39:51,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 21:39:51,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-21 21:39:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:39:51,312 INFO L225 Difference]: With dead ends: 388 [2019-11-21 21:39:51,312 INFO L226 Difference]: Without dead ends: 388 [2019-11-21 21:39:51,312 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 21:39:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-21 21:39:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 387. [2019-11-21 21:39:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-11-21 21:39:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 463 transitions. [2019-11-21 21:39:51,322 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 463 transitions. Word has length 47 [2019-11-21 21:39:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:39:51,322 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 463 transitions. [2019-11-21 21:39:51,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 21:39:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 463 transitions. [2019-11-21 21:39:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 21:39:51,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:39:51,324 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 21:39:51,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:39:51,527 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 21:39:51,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:39:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2041306869, now seen corresponding path program 1 times [2019-11-21 21:39:51,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:39:51,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1764201379] [2019-11-21 21:39:51,528 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 21:39:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:39:51,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 21:39:51,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:39:51,902 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:39:51,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:39:52,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:39:52,327 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 21:39:52,327 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 21:39:52,334 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 21:39:52,334 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 21:39:52,346 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 21:39:52,346 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 21:39:52,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:39:52,392 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 21:39:52,392 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2019-11-21 21:39:52,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:39:52,808 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 21:39:52,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,809 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 21:39:52,835 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:39:52,836 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 21:39:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,838 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 21:39:52,957 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-21 21:39:52,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:39:52,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,959 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 21:39:52,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:78 [2019-11-21 21:39:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:52,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:39:53,598 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-11-21 21:39:53,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:39:54,347 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-11-21 21:39:54,691 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:39:54,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1764201379] [2019-11-21 21:39:54,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:39:54,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2019-11-21 21:39:54,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065702667] [2019-11-21 21:39:54,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-21 21:39:54,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:39:54,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-21 21:39:54,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-21 21:39:54,693 INFO L87 Difference]: Start difference. First operand 387 states and 463 transitions. Second operand 24 states. [2019-11-21 21:39:55,856 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-11-21 21:39:56,125 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-21 21:39:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:39:59,467 INFO L93 Difference]: Finished difference Result 440 states and 525 transitions. [2019-11-21 21:39:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 21:39:59,468 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2019-11-21 21:39:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:39:59,469 INFO L225 Difference]: With dead ends: 440 [2019-11-21 21:39:59,469 INFO L226 Difference]: Without dead ends: 440 [2019-11-21 21:39:59,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2019-11-21 21:39:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-21 21:39:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 391. [2019-11-21 21:39:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-21 21:39:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 469 transitions. [2019-11-21 21:39:59,477 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 469 transitions. Word has length 47 [2019-11-21 21:39:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:39:59,477 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 469 transitions. [2019-11-21 21:39:59,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-21 21:39:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 469 transitions. [2019-11-21 21:39:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-21 21:39:59,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:39:59,478 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 21:39:59,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:39:59,679 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 21:39:59,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:39:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1367439760, now seen corresponding path program 1 times [2019-11-21 21:39:59,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:39:59,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2044186877] [2019-11-21 21:39:59,682 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 21:39:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:39:59,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 21:39:59,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:40:00,023 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 21:40:00,023 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:40:00,380 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 21:40:00,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2044186877] [2019-11-21 21:40:00,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:40:00,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-11-21 21:40:00,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364455180] [2019-11-21 21:40:00,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-21 21:40:00,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:40:00,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-21 21:40:00,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-11-21 21:40:00,382 INFO L87 Difference]: Start difference. First operand 391 states and 469 transitions. Second operand 23 states. [2019-11-21 21:40:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:40:02,587 INFO L93 Difference]: Finished difference Result 511 states and 603 transitions. [2019-11-21 21:40:02,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-21 21:40:02,588 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2019-11-21 21:40:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:40:02,590 INFO L225 Difference]: With dead ends: 511 [2019-11-21 21:40:02,590 INFO L226 Difference]: Without dead ends: 511 [2019-11-21 21:40:02,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2019-11-21 21:40:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-21 21:40:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 445. [2019-11-21 21:40:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-11-21 21:40:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 535 transitions. [2019-11-21 21:40:02,599 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 535 transitions. Word has length 45 [2019-11-21 21:40:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:40:02,599 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 535 transitions. [2019-11-21 21:40:02,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-21 21:40:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 535 transitions. [2019-11-21 21:40:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-21 21:40:02,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:40:02,601 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 21:40:02,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:02,804 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 21:40:02,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:40:02,804 INFO L82 PathProgramCache]: Analyzing trace with hash -132291445, now seen corresponding path program 1 times [2019-11-21 21:40:02,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:40:02,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1533070561] [2019-11-21 21:40:02,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:40:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:40:02,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 21:40:02,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:40:02,996 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:40:02,997 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:40:03,161 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:40:03,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1533070561] [2019-11-21 21:40:03,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:40:03,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-21 21:40:03,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940933119] [2019-11-21 21:40:03,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 21:40:03,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:40:03,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 21:40:03,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-21 21:40:03,163 INFO L87 Difference]: Start difference. First operand 445 states and 535 transitions. Second operand 13 states. [2019-11-21 21:40:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:40:03,550 INFO L93 Difference]: Finished difference Result 477 states and 569 transitions. [2019-11-21 21:40:03,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 21:40:03,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-11-21 21:40:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:40:03,553 INFO L225 Difference]: With dead ends: 477 [2019-11-21 21:40:03,554 INFO L226 Difference]: Without dead ends: 473 [2019-11-21 21:40:03,554 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 21:40:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-21 21:40:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 445. [2019-11-21 21:40:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-11-21 21:40:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 533 transitions. [2019-11-21 21:40:03,564 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 533 transitions. Word has length 50 [2019-11-21 21:40:03,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:40:03,565 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 533 transitions. [2019-11-21 21:40:03,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 21:40:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 533 transitions. [2019-11-21 21:40:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 21:40:03,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:40:03,566 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 21:40:03,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:03,770 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 21:40:03,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:40:03,771 INFO L82 PathProgramCache]: Analyzing trace with hash 829711509, now seen corresponding path program 4 times [2019-11-21 21:40:03,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:40:03,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1368011075] [2019-11-21 21:40:03,772 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 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:03,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-21 21:40:03,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 21:40:03,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-21 21:40:03,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:40:04,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:40:04,635 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:40:04,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:40:04,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:04,654 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:40:04,654 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:40:04,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:04,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:40:04,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:63 [2019-11-21 21:40:05,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 21:40:05,022 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:40:05,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:40:05,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:05,055 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:05,055 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:40:05,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:40:05,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:05,076 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:40:05,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:69 [2019-11-21 21:40:05,604 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 21:40:05,605 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:40:06,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:40:06,726 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 21:40:06,731 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:40:06,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:40:06,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:06,743 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 21:40:06,743 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 21:40:06,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:06,753 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:40:06,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:9 [2019-11-21 21:40:06,969 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-21 21:40:10,248 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 21:40:10,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1368011075] [2019-11-21 21:40:10,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:40:10,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 59 [2019-11-21 21:40:10,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596810236] [2019-11-21 21:40:10,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-21 21:40:10,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:40:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-21 21:40:10,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=2928, Unknown=0, NotChecked=0, Total=3540 [2019-11-21 21:40:10,256 INFO L87 Difference]: Start difference. First operand 445 states and 533 transitions. Second operand 60 states. [2019-11-21 21:40:13,943 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 21:40:16,383 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 21:40:21,656 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-21 21:40:22,242 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-21 21:40:22,712 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-21 21:40:23,078 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-21 21:40:23,530 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-21 21:40:23,881 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-21 21:40:24,325 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-21 21:40:24,652 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-21 21:40:25,045 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-21 21:40:25,362 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 21:40:25,703 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-21 21:40:26,008 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-21 21:40:26,334 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-21 21:40:26,640 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-21 21:40:27,068 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-21 21:40:27,664 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-21 21:40:28,023 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 21:40:28,322 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-21 21:40:28,681 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 21:40:28,947 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-21 21:40:29,247 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-21 21:40:29,890 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 21:40:30,600 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 21:40:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:40:35,157 INFO L93 Difference]: Finished difference Result 614 states and 728 transitions. [2019-11-21 21:40:35,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-11-21 21:40:35,158 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 47 [2019-11-21 21:40:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:40:35,160 INFO L225 Difference]: With dead ends: 614 [2019-11-21 21:40:35,160 INFO L226 Difference]: Without dead ends: 614 [2019-11-21 21:40:35,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3426 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=3213, Invalid=13817, Unknown=0, NotChecked=0, Total=17030 [2019-11-21 21:40:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-21 21:40:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 469. [2019-11-21 21:40:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-11-21 21:40:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 581 transitions. [2019-11-21 21:40:35,171 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 581 transitions. Word has length 47 [2019-11-21 21:40:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:40:35,171 INFO L462 AbstractCegarLoop]: Abstraction has 469 states and 581 transitions. [2019-11-21 21:40:35,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-21 21:40:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 581 transitions. [2019-11-21 21:40:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-21 21:40:35,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:40:35,173 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 21:40:35,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:35,376 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 21:40:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:40:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1553798517, now seen corresponding path program 1 times [2019-11-21 21:40:35,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:40:35,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1245858926] [2019-11-21 21:40:35,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:40:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:40:35,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 21:40:35,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:40:35,752 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 21:40:35,753 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:40:36,023 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 21:40:36,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1245858926] [2019-11-21 21:40:36,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:40:36,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-11-21 21:40:36,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607391757] [2019-11-21 21:40:36,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-21 21:40:36,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:40:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-21 21:40:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-11-21 21:40:36,025 INFO L87 Difference]: Start difference. First operand 469 states and 581 transitions. Second operand 21 states. [2019-11-21 21:40:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:40:37,226 INFO L93 Difference]: Finished difference Result 495 states and 596 transitions. [2019-11-21 21:40:37,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-21 21:40:37,227 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2019-11-21 21:40:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:40:37,228 INFO L225 Difference]: With dead ends: 495 [2019-11-21 21:40:37,228 INFO L226 Difference]: Without dead ends: 495 [2019-11-21 21:40:37,229 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 21:40:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-21 21:40:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 438. [2019-11-21 21:40:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-21 21:40:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 532 transitions. [2019-11-21 21:40:37,237 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 532 transitions. Word has length 49 [2019-11-21 21:40:37,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:40:37,237 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 532 transitions. [2019-11-21 21:40:37,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-21 21:40:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 532 transitions. [2019-11-21 21:40:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-21 21:40:37,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:40:37,239 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 21:40:37,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:37,442 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 21:40:37,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:40:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash -734032430, now seen corresponding path program 1 times [2019-11-21 21:40:37,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:40:37,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1287729129] [2019-11-21 21:40:37,445 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 21:40:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:40:37,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 21:40:37,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:40:37,598 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:40:37,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:40:37,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:37,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:40:37,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 21:40:37,680 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 21:40:37,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:40:37,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 21:40:37,739 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 21:40:37,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1287729129] [2019-11-21 21:40:37,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 21:40:37,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2019-11-21 21:40:37,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480402032] [2019-11-21 21:40:37,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 21:40:37,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:40:37,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 21:40:37,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 21:40:37,741 INFO L87 Difference]: Start difference. First operand 438 states and 532 transitions. Second operand 9 states. [2019-11-21 21:40:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:40:38,109 INFO L93 Difference]: Finished difference Result 437 states and 530 transitions. [2019-11-21 21:40:38,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 21:40:38,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-21 21:40:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:40:38,111 INFO L225 Difference]: With dead ends: 437 [2019-11-21 21:40:38,111 INFO L226 Difference]: Without dead ends: 437 [2019-11-21 21:40:38,111 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 21:40:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-21 21:40:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-11-21 21:40:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-21 21:40:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 530 transitions. [2019-11-21 21:40:38,120 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 530 transitions. Word has length 54 [2019-11-21 21:40:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:40:38,121 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 530 transitions. [2019-11-21 21:40:38,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 21:40:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 530 transitions. [2019-11-21 21:40:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-21 21:40:38,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:40:38,122 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 21:40:38,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:38,328 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 21:40:38,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:40:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash -734032429, now seen corresponding path program 1 times [2019-11-21 21:40:38,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:40:38,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1237455837] [2019-11-21 21:40:38,330 INFO L94 rtionOrderModulation]: Keeping assertion order 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 21:40:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:40:38,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 21:40:38,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:40:38,511 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:40:38,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 21:40:38,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 21:40:38,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 21:40:38,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-21 21:40:38,902 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 21:40:38,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:40:42,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:40:42,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:40:42,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:40:42,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 21:40:42,126 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:40:42,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1237455837] [2019-11-21 21:40:42,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:40:42,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2019-11-21 21:40:42,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197916436] [2019-11-21 21:40:42,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-21 21:40:42,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:40:42,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-21 21:40:42,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-21 21:40:42,128 INFO L87 Difference]: Start difference. First operand 437 states and 530 transitions. Second operand 19 states. [2019-11-21 21:40:49,903 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 17 [2019-11-21 21:40:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:40:51,629 INFO L93 Difference]: Finished difference Result 539 states and 644 transitions. [2019-11-21 21:40:51,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 21:40:51,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-11-21 21:40:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:40:51,632 INFO L225 Difference]: With dead ends: 539 [2019-11-21 21:40:51,632 INFO L226 Difference]: Without dead ends: 539 [2019-11-21 21:40:51,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-11-21 21:40:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-11-21 21:40:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 505. [2019-11-21 21:40:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-21 21:40:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 616 transitions. [2019-11-21 21:40:51,643 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 616 transitions. Word has length 54 [2019-11-21 21:40:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:40:51,643 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 616 transitions. [2019-11-21 21:40:51,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-21 21:40:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 616 transitions. [2019-11-21 21:40:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-21 21:40:51,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:40:51,645 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 21:40:51,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:51,848 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 21:40:51,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:40:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1800364854, now seen corresponding path program 1 times [2019-11-21 21:40:51,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:40:51,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [10956963] [2019-11-21 21:40:51,849 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 21:40:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 21:40:52,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 21:40:52,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 21:40:52,107 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 21:40:52,107 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 21:40:52,307 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 21:40:52,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [10956963] [2019-11-21 21:40:52,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 21:40:52,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-21 21:40:52,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49914053] [2019-11-21 21:40:52,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 21:40:52,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 21:40:52,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 21:40:52,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-11-21 21:40:52,309 INFO L87 Difference]: Start difference. First operand 505 states and 616 transitions. Second operand 16 states. [2019-11-21 21:40:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 21:40:52,639 INFO L93 Difference]: Finished difference Result 513 states and 618 transitions. [2019-11-21 21:40:52,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 21:40:52,641 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-11-21 21:40:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 21:40:52,643 INFO L225 Difference]: With dead ends: 513 [2019-11-21 21:40:52,643 INFO L226 Difference]: Without dead ends: 513 [2019-11-21 21:40:52,644 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 21:40:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-21 21:40:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2019-11-21 21:40:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-11-21 21:40:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 608 transitions. [2019-11-21 21:40:52,650 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 608 transitions. Word has length 58 [2019-11-21 21:40:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 21:40:52,651 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 608 transitions. [2019-11-21 21:40:52,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 21:40:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 608 transitions. [2019-11-21 21:40:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-21 21:40:52,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 21:40:52,653 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 21:40:52,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:52,856 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 21:40:52,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 21:40:52,856 INFO L82 PathProgramCache]: Analyzing trace with hash -466620982, now seen corresponding path program 5 times [2019-11-21 21:40:52,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 21:40:52,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1543944606] [2019-11-21 21:40:52,857 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 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 21:40:53,031 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-11-21 21:40:53,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-21 21:40:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-21 21:40:53,187 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-21 21:40:53,187 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-21 21:40:53,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 21:40:53,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:40:53 BoogieIcfgContainer [2019-11-21 21:40:53,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-21 21:40:53,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-21 21:40:53,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-21 21:40:53,441 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-21 21:40:53,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:32:27" (3/4) ... [2019-11-21 21:40:53,444 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-21 21:40:53,514 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-21 21:40:53,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-21 21:40:53,516 INFO L168 Benchmark]: Toolchain (without parser) took 506911.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 961.7 MB in the beginning and 820.8 MB in the end (delta: 140.9 MB). Peak memory consumption was 314.4 MB. Max. memory is 11.5 GB. [2019-11-21 21:40:53,516 INFO L168 Benchmark]: CDTParser took 0.30 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 21:40:53,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-21 21:40:53,517 INFO L168 Benchmark]: Boogie Preprocessor took 53.35 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 21:40:53,517 INFO L168 Benchmark]: RCFGBuilder took 902.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2019-11-21 21:40:53,518 INFO L168 Benchmark]: TraceAbstraction took 505473.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.1 GB in the beginning and 828.1 MB in the end (delta: 253.6 MB). Peak memory consumption was 290.3 MB. Max. memory is 11.5 GB. [2019-11-21 21:40:53,518 INFO L168 Benchmark]: Witness Printer took 74.32 ms. Allocated memory is still 1.2 GB. Free memory was 828.1 MB in the beginning and 820.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-21 21:40:53,519 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.30 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 402.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.35 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 902.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 505473.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.1 GB in the beginning and 828.1 MB in the end (delta: 253.6 MB). Peak memory consumption was 290.3 MB. Max. memory is 11.5 GB. * Witness Printer took 74.32 ms. Allocated memory is still 1.2 GB. Free memory was 828.1 MB in the beginning and 820.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 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