./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5a079682 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/duplets.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.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 c261d11d6e37ef6eda45455c8074b5a0eac3352b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5a07968 [2019-11-22 11:02:55,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:02:55,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:02:55,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:02:55,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:02:55,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:02:55,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:02:55,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:02:55,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:02:55,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:02:55,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:02:55,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:02:55,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:02:55,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:02:55,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:02:55,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:02:55,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:02:55,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:02:55,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:02:55,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:02:55,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:02:55,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:02:55,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:02:55,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:02:55,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:02:55,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:02:55,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:02:55,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:02:55,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:02:55,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:02:55,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:02:55,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:02:55,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:02:55,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:02:55,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:02:55,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:02:55,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:02:55,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:02:55,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:02:55,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:02:55,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:02:55,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 11:02:55,366 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:02:55,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:02:55,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:02:55,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:02:55,372 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:02:55,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:02:55,372 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:02:55,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:02:55,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:02:55,374 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:02:55,375 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:02:55,375 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 11:02:55,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:02:55,376 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:02:55,376 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:02:55,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:02:55,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:02:55,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:02:55,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:02:55,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:02:55,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:02:55,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:02:55,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:02:55,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:02:55,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-22 11:02:55,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:02:55,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:02:55,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:02:55,692 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:02:55,693 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:02:55,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2019-11-22 11:02:55,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3865def/209d7998b7af4d919e508221dade3228/FLAG69bf158be [2019-11-22 11:02:56,244 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:02:56,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2019-11-22 11:02:56,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3865def/209d7998b7af4d919e508221dade3228/FLAG69bf158be [2019-11-22 11:02:56,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c3865def/209d7998b7af4d919e508221dade3228 [2019-11-22 11:02:56,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:02:56,649 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:02:56,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:02:56,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:02:56,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:02:56,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:56" (1/1) ... [2019-11-22 11:02:56,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33339763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:56, skipping insertion in model container [2019-11-22 11:02:56,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:02:56" (1/1) ... [2019-11-22 11:02:56,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:02:56,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:02:56,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:02:56,905 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:02:56,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:02:57,004 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:02:57,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57 WrapperNode [2019-11-22 11:02:57,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:02:57,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:02:57,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:02:57,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:02:57,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (1/1) ... [2019-11-22 11:02:57,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (1/1) ... [2019-11-22 11:02:57,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (1/1) ... [2019-11-22 11:02:57,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (1/1) ... [2019-11-22 11:02:57,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (1/1) ... [2019-11-22 11:02:57,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (1/1) ... [2019-11-22 11:02:57,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (1/1) ... [2019-11-22 11:02:57,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:02:57,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:02:57,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:02:57,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:02:57,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (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-22 11:02:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:02:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:02:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 11:02:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2019-11-22 11:02:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2019-11-22 11:02:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:02:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 11:02:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:02:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:02:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 11:02:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 11:02:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 11:02:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 11:02:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2019-11-22 11:02:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:02:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2019-11-22 11:02:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:02:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:02:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:02:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 11:02:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 11:02:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:02:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:02:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:02:57,659 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:02:57,659 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-22 11:02:57,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:57 BoogieIcfgContainer [2019-11-22 11:02:57,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:02:57,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:02:57,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:02:57,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:02:57,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:02:56" (1/3) ... [2019-11-22 11:02:57,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdd2ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:02:57, skipping insertion in model container [2019-11-22 11:02:57,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:02:57" (2/3) ... [2019-11-22 11:02:57,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdd2ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:02:57, skipping insertion in model container [2019-11-22 11:02:57,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:57" (3/3) ... [2019-11-22 11:02:57,672 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-22 11:02:57,682 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:02:57,690 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. [2019-11-22 11:02:57,702 INFO L249 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2019-11-22 11:02:57,725 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:02:57,726 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:02:57,726 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:02:57,726 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:02:57,726 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:02:57,727 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:02:57,727 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:02:57,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:02:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-11-22 11:02:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 11:02:57,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:57,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:57,779 INFO L410 AbstractCegarLoop]: === Iteration 1 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:02:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash -115732399, now seen corresponding path program 1 times [2019-11-22 11:02:57,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:57,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114207458] [2019-11-22 11:02:57,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:58,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114207458] [2019-11-22 11:02:58,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:58,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:02:58,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337430894] [2019-11-22 11:02:58,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:02:58,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:58,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:02:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:02:58,118 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 8 states. [2019-11-22 11:02:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:58,838 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2019-11-22 11:02:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:02:58,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-22 11:02:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:58,860 INFO L225 Difference]: With dead ends: 103 [2019-11-22 11:02:58,860 INFO L226 Difference]: Without dead ends: 100 [2019-11-22 11:02:58,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:02:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-22 11:02:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-22 11:02:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 11:02:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2019-11-22 11:02:58,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 14 [2019-11-22 11:02:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:58,943 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2019-11-22 11:02:58,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:02:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2019-11-22 11:02:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 11:02:58,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:58,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:58,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:02:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash -115732398, now seen corresponding path program 1 times [2019-11-22 11:02:58,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:58,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776902111] [2019-11-22 11:02:58,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:59,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776902111] [2019-11-22 11:02:59,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:59,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:02:59,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480814916] [2019-11-22 11:02:59,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:02:59,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:59,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:02:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:02:59,142 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 8 states. [2019-11-22 11:02:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:02:59,725 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-11-22 11:02:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:02:59,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-22 11:02:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:02:59,727 INFO L225 Difference]: With dead ends: 99 [2019-11-22 11:02:59,727 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 11:02:59,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:02:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 11:02:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-22 11:02:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-22 11:02:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-11-22 11:02:59,748 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 14 [2019-11-22 11:02:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:02:59,749 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-11-22 11:02:59,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:02:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-11-22 11:02:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 11:02:59,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:02:59,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:02:59,751 INFO L410 AbstractCegarLoop]: === Iteration 3 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:02:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:02:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash 707263019, now seen corresponding path program 1 times [2019-11-22 11:02:59,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:02:59,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7030433] [2019-11-22 11:02:59,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:02:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:02:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:02:59,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7030433] [2019-11-22 11:02:59,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:02:59,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:02:59,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372062260] [2019-11-22 11:02:59,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:02:59,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:02:59,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:02:59,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:02:59,915 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 8 states. [2019-11-22 11:03:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:00,426 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-11-22 11:03:00,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:03:00,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-22 11:03:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:00,429 INFO L225 Difference]: With dead ends: 98 [2019-11-22 11:03:00,429 INFO L226 Difference]: Without dead ends: 98 [2019-11-22 11:03:00,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:03:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-22 11:03:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-22 11:03:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-22 11:03:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-22 11:03:00,442 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 15 [2019-11-22 11:03:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:00,442 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-22 11:03:00,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:03:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-22 11:03:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 11:03:00,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:00,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:00,445 INFO L410 AbstractCegarLoop]: === Iteration 4 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:00,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745985, now seen corresponding path program 1 times [2019-11-22 11:03:00,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:00,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282199761] [2019-11-22 11:03:00,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:00,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282199761] [2019-11-22 11:03:00,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:00,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:03:00,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699212381] [2019-11-22 11:03:00,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:03:00,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:03:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:03:00,607 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 8 states. [2019-11-22 11:03:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:01,086 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-22 11:03:01,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:03:01,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-22 11:03:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:01,088 INFO L225 Difference]: With dead ends: 96 [2019-11-22 11:03:01,088 INFO L226 Difference]: Without dead ends: 96 [2019-11-22 11:03:01,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:03:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-22 11:03:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-22 11:03:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-22 11:03:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-11-22 11:03:01,097 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 23 [2019-11-22 11:03:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:01,097 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-11-22 11:03:01,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:03:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-11-22 11:03:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-22 11:03:01,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:01,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:01,099 INFO L410 AbstractCegarLoop]: === Iteration 5 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1976745986, now seen corresponding path program 1 times [2019-11-22 11:03:01,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:01,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782786110] [2019-11-22 11:03:01,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:01,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782786110] [2019-11-22 11:03:01,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:01,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-22 11:03:01,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912727022] [2019-11-22 11:03:01,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-22 11:03:01,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-22 11:03:01,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:01,287 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 11 states. [2019-11-22 11:03:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:02,231 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-11-22 11:03:02,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 11:03:02,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-11-22 11:03:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:02,233 INFO L225 Difference]: With dead ends: 116 [2019-11-22 11:03:02,234 INFO L226 Difference]: Without dead ends: 116 [2019-11-22 11:03:02,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-11-22 11:03:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-22 11:03:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-11-22 11:03:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-22 11:03:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-22 11:03:02,243 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 23 [2019-11-22 11:03:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:02,244 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-22 11:03:02,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-22 11:03:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-22 11:03:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 11:03:02,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:02,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:02,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:02,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1149583382, now seen corresponding path program 1 times [2019-11-22 11:03:02,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:02,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72623284] [2019-11-22 11:03:02,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:02,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72623284] [2019-11-22 11:03:02,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:02,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-22 11:03:02,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704298238] [2019-11-22 11:03:02,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:03:02,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:02,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:03:02,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:03:02,465 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 12 states. [2019-11-22 11:03:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:03,352 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2019-11-22 11:03:03,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 11:03:03,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-11-22 11:03:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:03,356 INFO L225 Difference]: With dead ends: 99 [2019-11-22 11:03:03,356 INFO L226 Difference]: Without dead ends: 99 [2019-11-22 11:03:03,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-22 11:03:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-22 11:03:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-11-22 11:03:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-22 11:03:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-11-22 11:03:03,379 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 24 [2019-11-22 11:03:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:03,380 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-11-22 11:03:03,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:03:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-11-22 11:03:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 11:03:03,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:03,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:03,382 INFO L410 AbstractCegarLoop]: === Iteration 7 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash 943033910, now seen corresponding path program 1 times [2019-11-22 11:03:03,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:03,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60357159] [2019-11-22 11:03:03,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:03,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60357159] [2019-11-22 11:03:03,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:03,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:03,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889348526] [2019-11-22 11:03:03,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:03,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:03,527 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2019-11-22 11:03:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:03,867 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-11-22 11:03:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:03:03,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-22 11:03:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:03,869 INFO L225 Difference]: With dead ends: 94 [2019-11-22 11:03:03,869 INFO L226 Difference]: Without dead ends: 94 [2019-11-22 11:03:03,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-22 11:03:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-11-22 11:03:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-22 11:03:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-11-22 11:03:03,876 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2019-11-22 11:03:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:03,877 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-11-22 11:03:03,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-11-22 11:03:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 11:03:03,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:03,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:03,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash 943033911, now seen corresponding path program 1 times [2019-11-22 11:03:03,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:03,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788789839] [2019-11-22 11:03:03,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:03,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788789839] [2019-11-22 11:03:03,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:03,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:03,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992384473] [2019-11-22 11:03:03,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:03,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:03,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:03,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:03,975 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2019-11-22 11:03:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:04,327 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2019-11-22 11:03:04,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:03:04,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-22 11:03:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:04,328 INFO L225 Difference]: With dead ends: 89 [2019-11-22 11:03:04,328 INFO L226 Difference]: Without dead ends: 89 [2019-11-22 11:03:04,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-22 11:03:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-22 11:03:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-22 11:03:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-11-22 11:03:04,333 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 26 [2019-11-22 11:03:04,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:04,334 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-11-22 11:03:04,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:04,334 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-11-22 11:03:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-22 11:03:04,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:04,335 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:04,335 INFO L410 AbstractCegarLoop]: === Iteration 9 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash 941830451, now seen corresponding path program 1 times [2019-11-22 11:03:04,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:04,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606185553] [2019-11-22 11:03:04,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:04,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606185553] [2019-11-22 11:03:04,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387481002] [2019-11-22 11:03:04,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 11:03:04,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:04,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:04,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2019-11-22 11:03:04,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877538817] [2019-11-22 11:03:04,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 11:03:04,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:04,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 11:03:04,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:03:04,517 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 5 states. [2019-11-22 11:03:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:04,584 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2019-11-22 11:03:04,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:03:04,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-22 11:03:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:04,586 INFO L225 Difference]: With dead ends: 112 [2019-11-22 11:03:04,586 INFO L226 Difference]: Without dead ends: 112 [2019-11-22 11:03:04,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-22 11:03:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-11-22 11:03:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-22 11:03:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-22 11:03:04,593 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2019-11-22 11:03:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:04,593 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-22 11:03:04,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 11:03:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-22 11:03:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-22 11:03:04,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:04,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:04,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:04,805 INFO L410 AbstractCegarLoop]: === Iteration 10 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash -830719863, now seen corresponding path program 1 times [2019-11-22 11:03:04,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:04,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287372209] [2019-11-22 11:03:04,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:04,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287372209] [2019-11-22 11:03:04,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:04,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:04,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926231174] [2019-11-22 11:03:04,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:04,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:04,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:04,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:04,902 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 7 states. [2019-11-22 11:03:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:05,206 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-22 11:03:05,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:03:05,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-22 11:03:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:05,208 INFO L225 Difference]: With dead ends: 88 [2019-11-22 11:03:05,209 INFO L226 Difference]: Without dead ends: 88 [2019-11-22 11:03:05,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-22 11:03:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-22 11:03:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-22 11:03:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2019-11-22 11:03:05,226 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 27 [2019-11-22 11:03:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:05,227 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2019-11-22 11:03:05,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2019-11-22 11:03:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-22 11:03:05,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:05,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:05,230 INFO L410 AbstractCegarLoop]: === Iteration 11 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:05,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash -830719862, now seen corresponding path program 1 times [2019-11-22 11:03:05,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:05,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118365784] [2019-11-22 11:03:05,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:05,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118365784] [2019-11-22 11:03:05,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:05,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:03:05,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079708222] [2019-11-22 11:03:05,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:05,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:05,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:05,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:03:05,344 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 7 states. [2019-11-22 11:03:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:05,627 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2019-11-22 11:03:05,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:03:05,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-22 11:03:05,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:05,629 INFO L225 Difference]: With dead ends: 83 [2019-11-22 11:03:05,629 INFO L226 Difference]: Without dead ends: 83 [2019-11-22 11:03:05,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-22 11:03:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-22 11:03:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-22 11:03:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-22 11:03:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-11-22 11:03:05,634 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 27 [2019-11-22 11:03:05,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:05,635 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-11-22 11:03:05,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-11-22 11:03:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-22 11:03:05,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:05,636 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] [2019-11-22 11:03:05,637 INFO L410 AbstractCegarLoop]: === Iteration 12 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash 48801308, now seen corresponding path program 1 times [2019-11-22 11:03:05,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:05,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687971586] [2019-11-22 11:03:05,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:05,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687971586] [2019-11-22 11:03:05,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251407483] [2019-11-22 11:03:05,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:05,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 11:03:05,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:05,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:05,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-11-22 11:03:05,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11801183] [2019-11-22 11:03:05,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:03:05,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:03:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:03:05,807 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 9 states. [2019-11-22 11:03:06,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:06,236 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-22 11:03:06,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-22 11:03:06,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-22 11:03:06,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:06,238 INFO L225 Difference]: With dead ends: 122 [2019-11-22 11:03:06,238 INFO L226 Difference]: Without dead ends: 122 [2019-11-22 11:03:06,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-22 11:03:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-22 11:03:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2019-11-22 11:03:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-22 11:03:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2019-11-22 11:03:06,249 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 31 [2019-11-22 11:03:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:06,250 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2019-11-22 11:03:06,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:03:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2019-11-22 11:03:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:03:06,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:06,256 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:03:06,456 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:06,456 INFO L410 AbstractCegarLoop]: === Iteration 13 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:06,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1425745197, now seen corresponding path program 2 times [2019-11-22 11:03:06,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:06,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786397670] [2019-11-22 11:03:06,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786397670] [2019-11-22 11:03:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423051485] [2019-11-22 11:03:06,560 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:06,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 11:03:06,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 11:03:06,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 11:03:06,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:03:06,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:06,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-22 11:03:06,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436569158] [2019-11-22 11:03:06,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-22 11:03:06,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:06,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-22 11:03:06,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:03:06,991 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 17 states. [2019-11-22 11:03:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:08,218 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2019-11-22 11:03:08,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-22 11:03:08,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-11-22 11:03:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:08,221 INFO L225 Difference]: With dead ends: 123 [2019-11-22 11:03:08,221 INFO L226 Difference]: Without dead ends: 123 [2019-11-22 11:03:08,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2019-11-22 11:03:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-22 11:03:08,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2019-11-22 11:03:08,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-22 11:03:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-11-22 11:03:08,227 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 36 [2019-11-22 11:03:08,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:08,228 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-11-22 11:03:08,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-22 11:03:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-11-22 11:03:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-22 11:03:08,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:08,230 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:03:08,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:08,435 INFO L410 AbstractCegarLoop]: === Iteration 14 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1630798574, now seen corresponding path program 1 times [2019-11-22 11:03:08,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:08,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877593407] [2019-11-22 11:03:08,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-22 11:03:08,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877593407] [2019-11-22 11:03:08,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473750781] [2019-11-22 11:03:08,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:08,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 11:03:08,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 11:03:08,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:08,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-11-22 11:03:08,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884031488] [2019-11-22 11:03:08,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:03:08,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:03:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:03:08,704 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 6 states. [2019-11-22 11:03:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:08,770 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-11-22 11:03:08,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:03:08,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-22 11:03:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:08,772 INFO L225 Difference]: With dead ends: 104 [2019-11-22 11:03:08,772 INFO L226 Difference]: Without dead ends: 101 [2019-11-22 11:03:08,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:03:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-22 11:03:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2019-11-22 11:03:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-22 11:03:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-22 11:03:08,777 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 58 [2019-11-22 11:03:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:08,777 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-22 11:03:08,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:03:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-22 11:03:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-22 11:03:08,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:08,779 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:03:08,987 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:08,987 INFO L410 AbstractCegarLoop]: === Iteration 15 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1652012609, now seen corresponding path program 1 times [2019-11-22 11:03:08,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:08,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118848378] [2019-11-22 11:03:08,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-22 11:03:09,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118848378] [2019-11-22 11:03:09,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735031152] [2019-11-22 11:03:09,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-22 11:03:09,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-22 11:03:09,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:09,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 9 [2019-11-22 11:03:09,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356184465] [2019-11-22 11:03:09,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:03:09,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:09,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:03:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-22 11:03:09,210 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 7 states. [2019-11-22 11:03:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:09,292 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-22 11:03:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 11:03:09,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-11-22 11:03:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:09,294 INFO L225 Difference]: With dead ends: 86 [2019-11-22 11:03:09,294 INFO L226 Difference]: Without dead ends: 76 [2019-11-22 11:03:09,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-22 11:03:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-22 11:03:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-22 11:03:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 11:03:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2019-11-22 11:03:09,306 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 61 [2019-11-22 11:03:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:09,307 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2019-11-22 11:03:09,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:03:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2019-11-22 11:03:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-22 11:03:09,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:09,308 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:03:09,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:09,510 INFO L410 AbstractCegarLoop]: === Iteration 16 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash -35663204, now seen corresponding path program 1 times [2019-11-22 11:03:09,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:09,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690002600] [2019-11-22 11:03:09,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 11:03:09,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690002600] [2019-11-22 11:03:09,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:09,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 11:03:09,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713711] [2019-11-22 11:03:09,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-22 11:03:09,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-22 11:03:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-22 11:03:09,695 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2019-11-22 11:03:10,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:10,221 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-22 11:03:10,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-22 11:03:10,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-22 11:03:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:10,222 INFO L225 Difference]: With dead ends: 76 [2019-11-22 11:03:10,222 INFO L226 Difference]: Without dead ends: 76 [2019-11-22 11:03:10,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-22 11:03:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-22 11:03:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-22 11:03:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 11:03:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-22 11:03:10,225 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 64 [2019-11-22 11:03:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:10,227 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-22 11:03:10,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-22 11:03:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-22 11:03:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-22 11:03:10,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:10,229 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:03:10,229 INFO L410 AbstractCegarLoop]: === Iteration 17 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:10,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1633609241, now seen corresponding path program 1 times [2019-11-22 11:03:10,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:10,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61136273] [2019-11-22 11:03:10,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-22 11:03:10,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61136273] [2019-11-22 11:03:10,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364473954] [2019-11-22 11:03:10,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:10,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 11:03:10,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:10,577 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 11:03:10,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:10,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 16 [2019-11-22 11:03:10,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861873491] [2019-11-22 11:03:10,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 11:03:10,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 11:03:10,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-11-22 11:03:10,580 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-11-22 11:03:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:10,623 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2019-11-22 11:03:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 11:03:10,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-22 11:03:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:10,625 INFO L225 Difference]: With dead ends: 76 [2019-11-22 11:03:10,625 INFO L226 Difference]: Without dead ends: 75 [2019-11-22 11:03:10,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-22 11:03:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-22 11:03:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-22 11:03:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-22 11:03:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-22 11:03:10,629 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 66 [2019-11-22 11:03:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:10,630 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-22 11:03:10,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 11:03:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-22 11:03:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-22 11:03:10,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:10,631 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:03:10,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:10,835 INFO L410 AbstractCegarLoop]: === Iteration 18 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:10,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1616930628, now seen corresponding path program 1 times [2019-11-22 11:03:10,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:10,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689053968] [2019-11-22 11:03:10,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-22 11:03:11,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689053968] [2019-11-22 11:03:11,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015428739] [2019-11-22 11:03:11,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:11,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-22 11:03:11,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:11,513 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-22 11:03:11,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-22 11:03:11,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 11:03:11,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-11-22 11:03:11,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:11,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 44 [2019-11-22 11:03:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:11,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:11,793 INFO L567 ElimStorePlain]: treesize reduction 16, result has 68.6 percent of original size [2019-11-22 11:03:11,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:11,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:11,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:36 [2019-11-22 11:03:11,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:11,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:11,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:11,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:12,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 11:03:12,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-11-22 11:03:12,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:12,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 11:03:12,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-22 11:03:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-22 11:03:12,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:12,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2019-11-22 11:03:12,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595558407] [2019-11-22 11:03:12,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-22 11:03:12,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:12,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-22 11:03:12,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-11-22 11:03:12,896 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 17 states. [2019-11-22 11:03:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:15,861 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-11-22 11:03:15,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-22 11:03:15,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-11-22 11:03:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:15,863 INFO L225 Difference]: With dead ends: 78 [2019-11-22 11:03:15,863 INFO L226 Difference]: Without dead ends: 78 [2019-11-22 11:03:15,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2019-11-22 11:03:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-22 11:03:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-22 11:03:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-22 11:03:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-11-22 11:03:15,868 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 68 [2019-11-22 11:03:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:15,869 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-11-22 11:03:15,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-22 11:03:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-11-22 11:03:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-22 11:03:15,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:15,871 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:03:16,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:16,075 INFO L410 AbstractCegarLoop]: === Iteration 19 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash 907828895, now seen corresponding path program 1 times [2019-11-22 11:03:16,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:16,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883710066] [2019-11-22 11:03:16,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 11:03:16,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883710066] [2019-11-22 11:03:16,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:03:16,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-22 11:03:16,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678396341] [2019-11-22 11:03:16,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-22 11:03:16,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:16,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-22 11:03:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-22 11:03:16,323 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 13 states. [2019-11-22 11:03:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:17,162 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2019-11-22 11:03:17,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-22 11:03:17,163 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-11-22 11:03:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:17,164 INFO L225 Difference]: With dead ends: 126 [2019-11-22 11:03:17,165 INFO L226 Difference]: Without dead ends: 126 [2019-11-22 11:03:17,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-11-22 11:03:17,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-22 11:03:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-11-22 11:03:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-22 11:03:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-11-22 11:03:17,171 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 70 [2019-11-22 11:03:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:17,172 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-11-22 11:03:17,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-22 11:03:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-11-22 11:03:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-22 11:03:17,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:17,174 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:03:17,174 INFO L410 AbstractCegarLoop]: === Iteration 20 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1554600484, now seen corresponding path program 1 times [2019-11-22 11:03:17,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:17,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056937256] [2019-11-22 11:03:17,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-22 11:03:17,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056937256] [2019-11-22 11:03:17,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028980618] [2019-11-22 11:03:17,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:17,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-22 11:03:17,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:17,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-22 11:03:17,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:17,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:17,738 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-22 11:03:17,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-22 11:03:17,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-22 11:03:17,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:17,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:17,816 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-22 11:03:17,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-22 11:03:17,950 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 11:03:17,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 11:03:17,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:17,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:17,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:17,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 11:03:18,094 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 11:03:18,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 11:03:18,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:18,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:18,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:18,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 11:03:18,253 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 11:03:18,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 11:03:18,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:18,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:18,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:18,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 11:03:18,384 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 11:03:18,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 11:03:18,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:18,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:18,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:18,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 11:03:18,503 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 11:03:18,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 11:03:18,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:18,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:18,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:18,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 11:03:18,632 INFO L343 Elim1Store]: treesize reduction 44, result has 44.3 percent of original size [2019-11-22 11:03:18,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 61 [2019-11-22 11:03:18,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:18,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:18,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:18,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2019-11-22 11:03:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-22 11:03:18,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:03:18,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-11-22 11:03:18,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452481584] [2019-11-22 11:03:18,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-22 11:03:18,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:18,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-22 11:03:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-11-22 11:03:18,767 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 9 states. [2019-11-22 11:03:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:21,239 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-22 11:03:21,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:03:21,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-11-22 11:03:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:21,242 INFO L225 Difference]: With dead ends: 118 [2019-11-22 11:03:21,242 INFO L226 Difference]: Without dead ends: 83 [2019-11-22 11:03:21,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=60, Invalid=359, Unknown=1, NotChecked=0, Total=420 [2019-11-22 11:03:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-22 11:03:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-22 11:03:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-22 11:03:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2019-11-22 11:03:21,248 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 80 [2019-11-22 11:03:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:21,248 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2019-11-22 11:03:21,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-22 11:03:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2019-11-22 11:03:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-22 11:03:21,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:03:21,250 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2019-11-22 11:03:21,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:21,453 INFO L410 AbstractCegarLoop]: === Iteration 21 === [finddupErr1REQUIRES_VIOLATION, finddupErr6REQUIRES_VIOLATION, finddupErr7REQUIRES_VIOLATION, finddupErr5REQUIRES_VIOLATION, finddupErr0REQUIRES_VIOLATION, finddupErr4REQUIRES_VIOLATION, finddupErr2REQUIRES_VIOLATION, finddupErr3REQUIRES_VIOLATION, mkdupErr0REQUIRES_VIOLATION, mkdupErr1REQUIRES_VIOLATION, mkdupErr3REQUIRES_VIOLATION, mkdupErr2REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20ASSERT_VIOLATIONMEMORY_FREE, mainErr21ASSERT_VIOLATIONMEMORY_FREE, mainErr23ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-22 11:03:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:03:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1047974994, now seen corresponding path program 1 times [2019-11-22 11:03:21,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:03:21,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223091339] [2019-11-22 11:03:21,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:03:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 11:03:21,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223091339] [2019-11-22 11:03:21,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616834812] [2019-11-22 11:03:21,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:03:22,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-22 11:03:22,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:03:22,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 11:03:22,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:22,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:22,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:22,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2019-11-22 11:03:23,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-22 11:03:23,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 11:03:23,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 11:03:23,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 11:03:23,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-11-22 11:03:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-22 11:03:23,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:03:23,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 30 [2019-11-22 11:03:23,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522805844] [2019-11-22 11:03:23,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-22 11:03:23,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:03:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-22 11:03:23,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-11-22 11:03:23,174 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 31 states. [2019-11-22 11:03:29,450 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-22 11:03:30,201 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-11-22 11:03:31,468 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-22 11:03:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:03:32,403 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2019-11-22 11:03:32,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-22 11:03:32,403 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 83 [2019-11-22 11:03:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:03:32,404 INFO L225 Difference]: With dead ends: 117 [2019-11-22 11:03:32,404 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 11:03:32,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=458, Invalid=3448, Unknown=0, NotChecked=0, Total=3906 [2019-11-22 11:03:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 11:03:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 11:03:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 11:03:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 11:03:32,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2019-11-22 11:03:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:03:32,406 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 11:03:32,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-22 11:03:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 11:03:32,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 11:03:32,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:03:32,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:03:32 BoogieIcfgContainer [2019-11-22 11:03:32,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:03:32,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:03:32,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:03:32,618 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:03:32,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:02:57" (3/4) ... [2019-11-22 11:03:32,622 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 11:03:32,629 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 11:03:32,630 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mkdup [2019-11-22 11:03:32,630 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure finddup [2019-11-22 11:03:32,630 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 11:03:32,630 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 11:03:32,630 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 11:03:32,641 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-11-22 11:03:32,644 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-22 11:03:32,644 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-22 11:03:32,645 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 11:03:32,699 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 11:03:32,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:03:32,701 INFO L168 Benchmark]: Toolchain (without parser) took 36052.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 412.1 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -257.8 MB). Peak memory consumption was 154.3 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:32,701 INFO L168 Benchmark]: CDTParser took 0.29 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-22 11:03:32,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -197.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:32,702 INFO L168 Benchmark]: Boogie Preprocessor took 46.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:32,702 INFO L168 Benchmark]: RCFGBuilder took 607.81 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:32,703 INFO L168 Benchmark]: TraceAbstraction took 34956.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.4 MB). Peak memory consumption was 143.4 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:32,703 INFO L168 Benchmark]: Witness Printer took 81.50 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-11-22 11:03:32,705 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.29 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 355.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -197.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 607.81 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34956.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.4 MB). Peak memory consumption was 143.4 MB. Max. memory is 11.5 GB. * Witness Printer took 81.50 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 59]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 56]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 57]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 55]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 58]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 36 error locations. Result: SAFE, OverallTime: 34.8s, OverallIterations: 21, TraceHistogramMax: 5, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1220 SDtfs, 2611 SDslu, 3582 SDs, 0 SdLazy, 7642 SolverSat, 799 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 616 SyntacticMatches, 33 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 155 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1341 ConstructedInterpolants, 134 QuantifiedInterpolants, 833189 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 341/444 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...