./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/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/termination-crafted/4BitCounterPointer.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 0233d496bfaf5cb1311bfa260a57f41458184795 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:19:19,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:19:19,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:19:19,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:19:19,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:19:19,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:19:19,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:19:19,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:19:19,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:19:19,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:19:19,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:19:19,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:19:19,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:19:19,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:19:19,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:19:19,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:19:19,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:19:19,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:19:19,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:19:19,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:19:19,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:19:19,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:19:19,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:19:19,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:19:19,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:19:19,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:19:19,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:19:19,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:19:19,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:19:19,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:19:19,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:19:19,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:19:19,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:19:19,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:19:19,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:19:19,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:19:19,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:19:19,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:19:19,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:19:19,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:19:19,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:19:19,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-28 20:19:19,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:19:19,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:19:19,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:19:19,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:19:19,580 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:19:19,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:19:19,581 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:19:19,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:19:19,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:19:19,581 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:19:19,582 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:19:19,583 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:19:19,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:19:19,584 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:19:19,584 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:19:19,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:19:19,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:19:19,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:19:19,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:19:19,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:19,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:19:19,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:19:19,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:19:19,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:19:19,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:19:19,587 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 -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-11-28 20:19:19,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:19:19,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:19:19,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:19:19,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:19:19,904 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:19:19,904 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-28 20:19:19,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528401ef2/a62fe805ae2740c59484cf7af6be1bdf/FLAGff0cc9d23 [2019-11-28 20:19:20,444 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:19:20,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-28 20:19:20,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528401ef2/a62fe805ae2740c59484cf7af6be1bdf/FLAGff0cc9d23 [2019-11-28 20:19:20,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528401ef2/a62fe805ae2740c59484cf7af6be1bdf [2019-11-28 20:19:20,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:19:20,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:19:20,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:20,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:19:20,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:19:20,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:20" (1/1) ... [2019-11-28 20:19:20,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10525ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:20, skipping insertion in model container [2019-11-28 20:19:20,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:20" (1/1) ... [2019-11-28 20:19:20,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:19:20,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:19:21,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:21,063 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:19:21,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:21,092 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:19:21,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21 WrapperNode [2019-11-28 20:19:21,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:21,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:19:21,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:19:21,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:19:21,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (1/1) ... [2019-11-28 20:19:21,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (1/1) ... [2019-11-28 20:19:21,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (1/1) ... [2019-11-28 20:19:21,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (1/1) ... [2019-11-28 20:19:21,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (1/1) ... [2019-11-28 20:19:21,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (1/1) ... [2019-11-28 20:19:21,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (1/1) ... [2019-11-28 20:19:21,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:19:21,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:19:21,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:19:21,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:19:21,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (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-28 20:19:21,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:19:21,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:19:21,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:19:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:19:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:19:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:19:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:19:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:19:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:19:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:19:21,660 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:19:21,660 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 20:19:21,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:21 BoogieIcfgContainer [2019-11-28 20:19:21,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:19:21,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:19:21,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:19:21,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:19:21,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:19:20" (1/3) ... [2019-11-28 20:19:21,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a2c63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:21, skipping insertion in model container [2019-11-28 20:19:21,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:21" (2/3) ... [2019-11-28 20:19:21,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a2c63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:21, skipping insertion in model container [2019-11-28 20:19:21,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:21" (3/3) ... [2019-11-28 20:19:21,670 INFO L109 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-11-28 20:19:21,680 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:19:21,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-28 20:19:21,701 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-28 20:19:21,723 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:19:21,723 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:19:21,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:19:21,723 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:19:21,723 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:19:21,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:19:21,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:19:21,724 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:19:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-11-28 20:19:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:19:21,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:21,751 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:21,751 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145205, now seen corresponding path program 1 times [2019-11-28 20:19:21,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:21,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63142739] [2019-11-28 20:19:21,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:22,005 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-28 20:19:22,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63142739] [2019-11-28 20:19:22,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:22,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:22,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738687943] [2019-11-28 20:19:22,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:22,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:22,045 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2019-11-28 20:19:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:22,309 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 20:19:22,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:22,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:19:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:22,328 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:19:22,328 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:19:22,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:19:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 20:19:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:19:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-28 20:19:22,391 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 7 [2019-11-28 20:19:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:22,392 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-28 20:19:22,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-28 20:19:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:19:22,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:22,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:22,395 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1507145206, now seen corresponding path program 1 times [2019-11-28 20:19:22,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:22,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137031437] [2019-11-28 20:19:22,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:22,550 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-28 20:19:22,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137031437] [2019-11-28 20:19:22,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:22,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:22,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471844643] [2019-11-28 20:19:22,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:22,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:22,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:22,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:22,555 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 4 states. [2019-11-28 20:19:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:22,694 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-11-28 20:19:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:22,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:19:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:22,696 INFO L225 Difference]: With dead ends: 50 [2019-11-28 20:19:22,696 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 20:19:22,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 20:19:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 20:19:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:19:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-28 20:19:22,705 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 7 [2019-11-28 20:19:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:22,705 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-28 20:19:22,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-28 20:19:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:22,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:22,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:22,707 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:22,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:22,708 INFO L82 PathProgramCache]: Analyzing trace with hash -523138922, now seen corresponding path program 1 times [2019-11-28 20:19:22,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:22,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629927256] [2019-11-28 20:19:22,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:22,771 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-28 20:19:22,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629927256] [2019-11-28 20:19:22,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:22,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:22,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652699652] [2019-11-28 20:19:22,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:22,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:22,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:22,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:22,774 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2019-11-28 20:19:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:22,910 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-28 20:19:22,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:22,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:22,912 INFO L225 Difference]: With dead ends: 46 [2019-11-28 20:19:22,913 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 20:19:22,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 20:19:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-28 20:19:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 20:19:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-28 20:19:22,920 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 8 [2019-11-28 20:19:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:22,921 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-28 20:19:22,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-28 20:19:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:22,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:22,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:22,923 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -523138921, now seen corresponding path program 1 times [2019-11-28 20:19:22,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:22,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312905703] [2019-11-28 20:19:22,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,051 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-28 20:19:23,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312905703] [2019-11-28 20:19:23,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:23,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:23,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222917488] [2019-11-28 20:19:23,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:23,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:23,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:23,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,056 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 4 states. [2019-11-28 20:19:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:23,158 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-28 20:19:23,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:23,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:23,160 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:19:23,160 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:19:23,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:19:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-28 20:19:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 20:19:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-28 20:19:23,167 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-11-28 20:19:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:23,168 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-28 20:19:23,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-28 20:19:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:19:23,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:23,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:23,170 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash 962562584, now seen corresponding path program 1 times [2019-11-28 20:19:23,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:23,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216706338] [2019-11-28 20:19:23,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:23,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216706338] [2019-11-28 20:19:23,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:23,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:23,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065232860] [2019-11-28 20:19:23,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:23,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,250 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-11-28 20:19:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:23,377 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-28 20:19:23,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:23,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 20:19:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:23,379 INFO L225 Difference]: With dead ends: 38 [2019-11-28 20:19:23,379 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 20:19:23,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 20:19:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 20:19:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:19:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2019-11-28 20:19:23,392 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 9 [2019-11-28 20:19:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:23,392 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2019-11-28 20:19:23,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2019-11-28 20:19:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:19:23,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:23,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:23,395 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash 962562585, now seen corresponding path program 1 times [2019-11-28 20:19:23,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:23,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658165591] [2019-11-28 20:19:23,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,499 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-28 20:19:23,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658165591] [2019-11-28 20:19:23,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:23,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:23,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187042540] [2019-11-28 20:19:23,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:23,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:23,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:23,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,505 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 4 states. [2019-11-28 20:19:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:23,598 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-28 20:19:23,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:23,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 20:19:23,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:23,600 INFO L225 Difference]: With dead ends: 34 [2019-11-28 20:19:23,600 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 20:19:23,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 20:19:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 20:19:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 20:19:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-28 20:19:23,616 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 9 [2019-11-28 20:19:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:23,617 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-28 20:19:23,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-28 20:19:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:19:23,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:23,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:23,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:23,621 INFO L82 PathProgramCache]: Analyzing trace with hash -225330983, now seen corresponding path program 1 times [2019-11-28 20:19:23,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:23,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807489806] [2019-11-28 20:19:23,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:23,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807489806] [2019-11-28 20:19:23,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:23,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:23,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546387127] [2019-11-28 20:19:23,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:23,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:23,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,694 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 4 states. [2019-11-28 20:19:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:23,773 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-11-28 20:19:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:23,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:19:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:23,775 INFO L225 Difference]: With dead ends: 31 [2019-11-28 20:19:23,775 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 20:19:23,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 20:19:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-28 20:19:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 20:19:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-28 20:19:23,780 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 10 [2019-11-28 20:19:23,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:23,780 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-28 20:19:23,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:23,781 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-11-28 20:19:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:19:23,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:23,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:23,781 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:23,782 INFO L82 PathProgramCache]: Analyzing trace with hash -225330982, now seen corresponding path program 1 times [2019-11-28 20:19:23,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:23,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793956580] [2019-11-28 20:19:23,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,832 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-28 20:19:23,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793956580] [2019-11-28 20:19:23,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:23,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:23,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973049079] [2019-11-28 20:19:23,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:23,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:23,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,835 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2019-11-28 20:19:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:23,902 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-11-28 20:19:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:23,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:19:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:23,904 INFO L225 Difference]: With dead ends: 28 [2019-11-28 20:19:23,904 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 20:19:23,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 20:19:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 20:19:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 20:19:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-28 20:19:23,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2019-11-28 20:19:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:23,908 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-28 20:19:23,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-28 20:19:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 20:19:23,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:23,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:23,910 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:23,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:23,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1860435007, now seen corresponding path program 1 times [2019-11-28 20:19:23,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:23,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137002161] [2019-11-28 20:19:23,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:23,962 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-28 20:19:23,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137002161] [2019-11-28 20:19:23,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:23,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:19:23,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521871149] [2019-11-28 20:19:23,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:19:23,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:23,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:19:23,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:19:23,965 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-11-28 20:19:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:24,078 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-11-28 20:19:24,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:24,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 20:19:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:24,080 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:19:24,080 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:19:24,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:19:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:19:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-28 20:19:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:19:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 20:19:24,085 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2019-11-28 20:19:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:24,085 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 20:19:24,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:19:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 20:19:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:19:24,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:24,086 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:24,087 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 988980839, now seen corresponding path program 1 times [2019-11-28 20:19:24,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:24,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890474054] [2019-11-28 20:19:24,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:24,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890474054] [2019-11-28 20:19:24,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834398677] [2019-11-28 20:19:24,249 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-28 20:19:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:24,324 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 20:19:24,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:24,408 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:24,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-28 20:19:24,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:24,425 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:24,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:24,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2019-11-28 20:19:24,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:19:24,446 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:24,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:24,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:24,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-28 20:19:24,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 20:19:24,469 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:24,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:24,477 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:24,478 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-28 20:19:24,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:19:24,504 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:24,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:24,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:24,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-28 20:19:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:24,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:24,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 20:19:24,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588422541] [2019-11-28 20:19:24,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:19:24,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:24,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:19:24,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:24,514 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2019-11-28 20:19:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:24,815 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-28 20:19:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:19:24,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-28 20:19:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:24,816 INFO L225 Difference]: With dead ends: 36 [2019-11-28 20:19:24,816 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 20:19:24,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 20:19:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-11-28 20:19:24,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:19:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 20:19:24,820 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2019-11-28 20:19:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:24,821 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 20:19:24,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:19:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 20:19:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:19:24,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:24,822 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:25,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:25,024 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1875845268, now seen corresponding path program 1 times [2019-11-28 20:19:25,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:25,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750238675] [2019-11-28 20:19:25,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:25,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750238675] [2019-11-28 20:19:25,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800526772] [2019-11-28 20:19:25,398 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-28 20:19:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:25,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 20:19:25,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:25,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:25,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-28 20:19:25,474 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:25,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:25,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:25,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-11-28 20:19:25,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:19:25,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:25,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:25,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:25,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 20:19:25,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 20:19:25,564 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:25,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:25,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:25,581 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-11-28 20:19:25,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-28 20:19:25,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:25,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:25,674 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:25,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2019-11-28 20:19:25,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-28 20:19:25,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:25,747 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:25,748 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:25,748 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-11-28 20:19:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:25,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:25,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-11-28 20:19:25,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083967109] [2019-11-28 20:19:25,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 20:19:25,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 20:19:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:19:25,756 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 15 states. [2019-11-28 20:19:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:26,162 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-28 20:19:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:19:26,163 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-28 20:19:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:26,164 INFO L225 Difference]: With dead ends: 36 [2019-11-28 20:19:26,164 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 20:19:26,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:19:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 20:19:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-11-28 20:19:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:19:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 20:19:26,171 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-11-28 20:19:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:26,171 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 20:19:26,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 20:19:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 20:19:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:19:26,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:26,173 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:26,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:26,374 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:26,374 INFO L82 PathProgramCache]: Analyzing trace with hash -230868331, now seen corresponding path program 1 times [2019-11-28 20:19:26,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:26,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558553492] [2019-11-28 20:19:26,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:26,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558553492] [2019-11-28 20:19:26,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51458169] [2019-11-28 20:19:26,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-28 20:19:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:26,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 20:19:26,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:26,807 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-28 20:19:26,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:26,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:26,819 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:26,819 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 20:19:26,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:26,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 20:19:26,861 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:26,883 INFO L614 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-11-28 20:19:26,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:26,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-28 20:19:26,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:26,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 20:19:26,931 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:26,952 INFO L614 ElimStorePlain]: treesize reduction 16, result has 56.8 percent of original size [2019-11-28 20:19:26,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:26,953 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-28 20:19:27,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:27,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 20:19:27,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:27,022 INFO L614 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2019-11-28 20:19:27,023 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:27,023 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-11-28 20:19:27,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 20:19:27,060 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:27,065 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:27,065 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:27,066 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 20:19:27,084 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-28 20:19:27,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:27,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-11-28 20:19:27,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658752135] [2019-11-28 20:19:27,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:19:27,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:27,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:19:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:19:27,091 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2019-11-28 20:19:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:27,209 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-11-28 20:19:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:27,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-28 20:19:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:27,210 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:19:27,210 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:19:27,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:19:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:19:27,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-11-28 20:19:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:19:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-28 20:19:27,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2019-11-28 20:19:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:27,215 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 20:19:27,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:19:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-28 20:19:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:19:27,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:27,217 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:27,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:27,424 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash -587061395, now seen corresponding path program 1 times [2019-11-28 20:19:27,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:27,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587006375] [2019-11-28 20:19:27,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:28,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587006375] [2019-11-28 20:19:28,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469924871] [2019-11-28 20:19:28,021 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-28 20:19:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:28,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 20:19:28,086 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:28,124 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-28 20:19:28,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:28,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,144 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 20:19:28,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:28,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 20:19:28,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,227 INFO L614 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-11-28 20:19:28,228 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:28,228 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-28 20:19:28,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:28,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 20:19:28,285 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,310 INFO L614 ElimStorePlain]: treesize reduction 16, result has 60.0 percent of original size [2019-11-28 20:19:28,311 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-28 20:19:28,381 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:28,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 68 [2019-11-28 20:19:28,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,430 INFO L614 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-28 20:19:28,430 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,431 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:39 [2019-11-28 20:19:28,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:28,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:28,689 INFO L430 ElimStorePlain]: Different costs {3=[v_prenex_2], 5=[|v_#memory_int_42|]} [2019-11-28 20:19:28,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:28,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:19:28,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,753 INFO L614 ElimStorePlain]: treesize reduction 16, result has 76.5 percent of original size [2019-11-28 20:19:28,775 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:28,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:19:28,777 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,821 INFO L614 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-11-28 20:19:28,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 20:19:28,823 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-28 20:19:28,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:19:28,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,884 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:28,885 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:28,886 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-11-28 20:19:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:28,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:28,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-11-28 20:19:28,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353917742] [2019-11-28 20:19:28,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 20:19:28,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:28,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 20:19:28,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:19:28,932 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 24 states. [2019-11-28 20:19:29,845 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-11-28 20:19:30,342 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-11-28 20:19:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:31,192 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-11-28 20:19:31,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 20:19:31,193 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-11-28 20:19:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:31,195 INFO L225 Difference]: With dead ends: 65 [2019-11-28 20:19:31,195 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 20:19:31,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=414, Invalid=1566, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 20:19:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 20:19:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-11-28 20:19:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:19:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-28 20:19:31,201 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-11-28 20:19:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:31,201 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-28 20:19:31,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 20:19:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-28 20:19:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 20:19:31,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:31,203 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:31,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:31,411 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:31,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash 349814, now seen corresponding path program 1 times [2019-11-28 20:19:31,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:31,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957158423] [2019-11-28 20:19:31,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:31,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957158423] [2019-11-28 20:19:31,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164615874] [2019-11-28 20:19:31,526 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-28 20:19:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:31,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:19:31,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:31,618 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-28 20:19:31,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:31,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:31,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:31,626 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-11-28 20:19:31,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:31,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 20:19:31,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:31,684 INFO L614 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2019-11-28 20:19:31,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:31,684 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:25 [2019-11-28 20:19:31,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 20:19:31,783 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:31,813 INFO L614 ElimStorePlain]: treesize reduction 7, result has 61.1 percent of original size [2019-11-28 20:19:31,813 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:31,813 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2019-11-28 20:19:31,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 20:19:31,837 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:31,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:31,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:31,839 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-28 20:19:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:31,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:31,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-28 20:19:31,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628516667] [2019-11-28 20:19:31,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 20:19:31,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:31,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:19:31,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:19:31,859 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 16 states. [2019-11-28 20:19:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:32,321 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2019-11-28 20:19:32,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:19:32,321 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-11-28 20:19:32,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:32,322 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:19:32,322 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 20:19:32,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-11-28 20:19:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 20:19:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-11-28 20:19:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 20:19:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-28 20:19:32,326 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 34 [2019-11-28 20:19:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:32,326 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-28 20:19:32,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 20:19:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-28 20:19:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 20:19:32,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:32,328 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:32,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:32,529 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:32,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:32,530 INFO L82 PathProgramCache]: Analyzing trace with hash 210942700, now seen corresponding path program 1 times [2019-11-28 20:19:32,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:32,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631687228] [2019-11-28 20:19:32,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:19:32,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631687228] [2019-11-28 20:19:32,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643075201] [2019-11-28 20:19:32,797 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-28 20:19:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:32,846 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 20:19:32,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:32,875 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-28 20:19:32,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:32,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:32,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:32,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-28 20:19:32,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:32,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 20:19:32,927 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:32,952 INFO L614 ElimStorePlain]: treesize reduction 16, result has 62.8 percent of original size [2019-11-28 20:19:32,952 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:32,952 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-28 20:19:33,009 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 68 [2019-11-28 20:19:33,011 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,049 INFO L614 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-28 20:19:33,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2019-11-28 20:19:33,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:19:33,118 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:19:33,152 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-28 20:19:33,160 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,206 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 20:19:33,208 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,344 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2019-11-28 20:19:33,345 INFO L614 ElimStorePlain]: treesize reduction 167, result has 16.9 percent of original size [2019-11-28 20:19:33,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,346 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:165, output treesize:34 [2019-11-28 20:19:33,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 110 [2019-11-28 20:19:33,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,483 INFO L614 ElimStorePlain]: treesize reduction 36, result has 59.6 percent of original size [2019-11-28 20:19:33,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:53 [2019-11-28 20:19:33,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:33,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:19:33,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-28 20:19:33,579 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:19:33,611 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-28 20:19:33,657 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 20:19:33,715 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 20:19:33,776 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 137 [2019-11-28 20:19:33,879 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:33,929 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:33,929 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 20:19:33,930 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:34,337 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-11-28 20:19:34,338 INFO L614 ElimStorePlain]: treesize reduction 340, result has 34.7 percent of original size [2019-11-28 20:19:34,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-28 20:19:34,339 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:369, output treesize:181 [2019-11-28 20:19:34,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-28 20:19:34,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:34,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:34,773 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-11-28 20:19:34,952 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-11-28 20:19:34,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:19:34,963 INFO L430 ElimStorePlain]: Different costs {9=[|v_#memory_int_52|, v_prenex_5], 11=[v_prenex_7]} [2019-11-28 20:19:35,002 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:35,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 20:19:35,003 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,124 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-11-28 20:19:35,125 INFO L614 ElimStorePlain]: treesize reduction 32, result has 78.7 percent of original size [2019-11-28 20:19:35,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:35,171 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 20:19:35,172 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,286 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-28 20:19:35,287 INFO L614 ElimStorePlain]: treesize reduction 32, result has 78.2 percent of original size [2019-11-28 20:19:35,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:35,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-28 20:19:35,333 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,452 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-28 20:19:35,453 INFO L614 ElimStorePlain]: treesize reduction 32, result has 77.8 percent of original size [2019-11-28 20:19:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-28 20:19:35,457 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:121, output treesize:112 [2019-11-28 20:19:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:35,666 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_int_53|], 9=[v_prenex_8]} [2019-11-28 20:19:35,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:35,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-11-28 20:19:35,719 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 20:19:35,728 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,809 INFO L614 ElimStorePlain]: treesize reduction 69, result has 58.2 percent of original size [2019-11-28 20:19:35,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:35,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-11-28 20:19:35,856 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 20:19:35,864 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,907 INFO L614 ElimStorePlain]: treesize reduction 69, result has 39.5 percent of original size [2019-11-28 20:19:35,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 20:19:35,908 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:147, output treesize:45 [2019-11-28 20:19:35,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:19:35,966 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,970 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:35,970 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:35,970 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-11-28 20:19:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:35,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:35,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 21 [2019-11-28 20:19:35,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788045414] [2019-11-28 20:19:35,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:19:35,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:19:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:19:35,990 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 21 states. [2019-11-28 20:19:36,753 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-11-28 20:19:36,977 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-11-28 20:19:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:37,457 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-11-28 20:19:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:19:37,458 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2019-11-28 20:19:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:37,459 INFO L225 Difference]: With dead ends: 88 [2019-11-28 20:19:37,459 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 20:19:37,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2019-11-28 20:19:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 20:19:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2019-11-28 20:19:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 20:19:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-28 20:19:37,470 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 44 [2019-11-28 20:19:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:37,472 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-28 20:19:37,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:19:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-28 20:19:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 20:19:37,475 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:37,475 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:37,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:37,679 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 264149196, now seen corresponding path program 1 times [2019-11-28 20:19:37,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:37,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210329972] [2019-11-28 20:19:37,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:19:37,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210329972] [2019-11-28 20:19:37,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077616890] [2019-11-28 20:19:37,826 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-28 20:19:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:37,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 20:19:37,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:37,907 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:37,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-28 20:19:37,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:37,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:37,920 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:37,920 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:11 [2019-11-28 20:19:37,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:19:37,941 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:37,949 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:37,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:37,950 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-28 20:19:37,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 20:19:37,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:37,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:37,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:37,978 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:14 [2019-11-28 20:19:38,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:19:38,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:38,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-28 20:19:38,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:38,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 20:19:38,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,074 INFO L614 ElimStorePlain]: treesize reduction 12, result has 70.7 percent of original size [2019-11-28 20:19:38,075 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,075 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-11-28 20:19:38,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:38,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 20:19:38,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:38,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 60 [2019-11-28 20:19:38,148 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,235 INFO L614 ElimStorePlain]: treesize reduction 20, result has 77.5 percent of original size [2019-11-28 20:19:38,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:38,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-28 20:19:38,238 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:69 [2019-11-28 20:19:38,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:38,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:19:38,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:19:38,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 20:19:38,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:38,442 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:19:38,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-28 20:19:38,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 20:19:38,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:19:38,473 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:19:38,473 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-28 20:19:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 20:19:38,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:38,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-11-28 20:19:38,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523706471] [2019-11-28 20:19:38,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 20:19:38,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:38,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 20:19:38,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:19:38,509 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 19 states. [2019-11-28 20:19:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:39,749 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-11-28 20:19:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 20:19:39,750 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-11-28 20:19:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:39,751 INFO L225 Difference]: With dead ends: 91 [2019-11-28 20:19:39,751 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 20:19:39,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 20:19:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 20:19:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2019-11-28 20:19:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 20:19:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-11-28 20:19:39,756 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 55 [2019-11-28 20:19:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:39,756 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-11-28 20:19:39,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 20:19:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-11-28 20:19:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 20:19:39,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:39,758 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:39,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:39,964 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION]=== [2019-11-28 20:19:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2053442217, now seen corresponding path program 2 times [2019-11-28 20:19:39,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:39,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673358435] [2019-11-28 20:19:39,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:40,364 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-11-28 20:19:40,603 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-11-28 20:19:40,795 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-28 20:19:40,915 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-28 20:19:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 102 proven. 38 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 20:19:41,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673358435] [2019-11-28 20:19:41,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238428571] [2019-11-28 20:19:41,650 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 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-28 20:19:41,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:19:41,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:41,709 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:19:41,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-28 20:19:41,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:41,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2019-11-28 20:19:41,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799193488] [2019-11-28 20:19:41,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:19:41,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:41,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:19:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:19:41,926 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2019-11-28 20:19:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:41,992 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-11-28 20:19:41,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:41,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-11-28 20:19:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:41,993 INFO L225 Difference]: With dead ends: 75 [2019-11-28 20:19:41,994 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:19:41,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:19:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:19:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:19:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:19:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:19:41,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2019-11-28 20:19:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:41,995 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:19:41,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:19:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:19:41,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:19:42,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:42,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:19:42 BoogieIcfgContainer [2019-11-28 20:19:42,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:19:42,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:19:42,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:19:42,205 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:19:42,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:21" (3/4) ... [2019-11-28 20:19:42,208 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:19:42,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:19:42,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:19:42,226 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-28 20:19:42,227 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 20:19:42,227 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:19:42,227 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:19:42,279 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:19:42,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:19:42,280 INFO L168 Benchmark]: Toolchain (without parser) took 21434.10 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 398.5 MB). Free memory was 955.0 MB in the beginning and 1.4 GB in the end (delta: -413.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:42,280 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:42,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.73 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:42,281 INFO L168 Benchmark]: Boogie Preprocessor took 90.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:42,282 INFO L168 Benchmark]: RCFGBuilder took 478.49 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:42,282 INFO L168 Benchmark]: TraceAbstraction took 20540.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -255.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:42,283 INFO L168 Benchmark]: Witness Printer took 75.04 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 20:19:42,285 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.73 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 478.49 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20540.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -255.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 75.04 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 61 locations, 31 error locations. Result: SAFE, OverallTime: 20.4s, OverallIterations: 17, TraceHistogramMax: 9, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 286 SDtfs, 971 SDslu, 832 SDs, 0 SdLazy, 2345 SolverSat, 565 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 510 GetRequests, 289 SyntacticMatches, 12 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 106 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 686 NumberOfCodeBlocks, 627 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 661 ConstructedInterpolants, 23 QuantifiedInterpolants, 895755 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1348 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 417/560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...