./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash f1dcdcb191cc3a70c9cb7bce226f0263f581cc07 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:06:48,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:06:48,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:06:48,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:06:48,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:06:48,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:06:48,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:06:48,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:06:48,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:06:48,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:06:48,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:06:48,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:06:48,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:06:48,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:06:48,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:06:48,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:06:48,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:06:48,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:06:48,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:06:48,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:06:48,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:06:48,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:06:48,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:06:48,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:06:48,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:06:48,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:06:48,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:06:48,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:06:48,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:06:48,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:06:48,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:06:48,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:06:48,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:06:48,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:06:48,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:06:48,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:06:48,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:06:48,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:06:48,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:06:48,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:06:48,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:06:48,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:06:48,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:06:48,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:06:48,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:06:48,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:06:48,642 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:06:48,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:06:48,643 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:06:48,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:06:48,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:06:48,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:06:48,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:06:48,645 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:06:48,646 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:06:48,646 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:06:48,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:06:48,647 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:06:48,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:06:48,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:06:48,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:06:48,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:06:48,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:06:48,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:06:48,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:06:48,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:06:48,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:06:48,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:06:48,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:06:48,650 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:06:48,651 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1dcdcb191cc3a70c9cb7bce226f0263f581cc07 [2019-11-28 20:06:48,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:06:48,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:06:49,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:06:49,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:06:49,004 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:06:49,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-28 20:06:49,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de6b09f38/3615dd3559ae42389e951b9e428f3908/FLAG14c2f2dfe [2019-11-28 20:06:49,557 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:06:49,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2019-11-28 20:06:49,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de6b09f38/3615dd3559ae42389e951b9e428f3908/FLAG14c2f2dfe [2019-11-28 20:06:49,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de6b09f38/3615dd3559ae42389e951b9e428f3908 [2019-11-28 20:06:49,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:06:49,940 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:06:49,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:06:49,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:06:49,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:06:49,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:06:49" (1/1) ... [2019-11-28 20:06:49,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e35fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:49, skipping insertion in model container [2019-11-28 20:06:49,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:06:49" (1/1) ... [2019-11-28 20:06:49,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:06:49,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:06:50,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:06:50,187 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:06:50,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:06:50,283 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:06:50,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50 WrapperNode [2019-11-28 20:06:50,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:06:50,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:06:50,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:06:50,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:06:50,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (1/1) ... [2019-11-28 20:06:50,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (1/1) ... [2019-11-28 20:06:50,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (1/1) ... [2019-11-28 20:06:50,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (1/1) ... [2019-11-28 20:06:50,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (1/1) ... [2019-11-28 20:06:50,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (1/1) ... [2019-11-28 20:06:50,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (1/1) ... [2019-11-28 20:06:50,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:06:50,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:06:50,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:06:50,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:06:50,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (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:06:50,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:06:50,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:06:50,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-28 20:06:50,389 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-28 20:06:50,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:06:50,390 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 20:06:50,390 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:06:50,390 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:06:50,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:06:50,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-28 20:06:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-28 20:06:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:06:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-28 20:06:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:06:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:06:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:06:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 20:06:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:06:50,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:06:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:06:50,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:06:50,816 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:06:50,817 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 20:06:50,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:50 BoogieIcfgContainer [2019-11-28 20:06:50,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:06:50,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:06:50,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:06:50,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:06:50,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:06:49" (1/3) ... [2019-11-28 20:06:50,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f83d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:06:50, skipping insertion in model container [2019-11-28 20:06:50,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:06:50" (2/3) ... [2019-11-28 20:06:50,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f83d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:06:50, skipping insertion in model container [2019-11-28 20:06:50,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:50" (3/3) ... [2019-11-28 20:06:50,826 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2019-11-28 20:06:50,837 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:06:50,844 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 20:06:50,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 20:06:50,874 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:06:50,874 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:06:50,874 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:06:50,874 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:06:50,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:06:50,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:06:50,875 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:06:50,875 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:06:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-28 20:06:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:06:50,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:50,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:50,905 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:50,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:50,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957205, now seen corresponding path program 1 times [2019-11-28 20:06:50,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:50,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667926758] [2019-11-28 20:06:50,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,262 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:06:51,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667926758] [2019-11-28 20:06:51,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:51,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:06:51,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45414785] [2019-11-28 20:06:51,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:06:51,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:51,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:06:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:06:51,290 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2019-11-28 20:06:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:51,661 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-28 20:06:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:06:51,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-28 20:06:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:51,675 INFO L225 Difference]: With dead ends: 59 [2019-11-28 20:06:51,675 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:06:51,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:06:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:06:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 20:06:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 20:06:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-28 20:06:51,726 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 18 [2019-11-28 20:06:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:51,728 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-28 20:06:51,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:06:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-28 20:06:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:06:51,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:51,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:51,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1731957204, now seen corresponding path program 1 times [2019-11-28 20:06:51,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:51,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14573535] [2019-11-28 20:06:51,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:51,932 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:06:51,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14573535] [2019-11-28 20:06:51,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:51,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:06:51,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8194911] [2019-11-28 20:06:51,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:06:51,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:51,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:06:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:06:51,942 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2019-11-28 20:06:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:52,298 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-28 20:06:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:06:52,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 20:06:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:52,301 INFO L225 Difference]: With dead ends: 54 [2019-11-28 20:06:52,301 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:06:52,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:06:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 20:06:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 20:06:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-28 20:06:52,312 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 18 [2019-11-28 20:06:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:52,313 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-28 20:06:52,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:06:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-28 20:06:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:06:52,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:52,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:52,315 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:52,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2036436141, now seen corresponding path program 1 times [2019-11-28 20:06:52,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:52,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290714815] [2019-11-28 20:06:52,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:52,632 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:06:52,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290714815] [2019-11-28 20:06:52,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:52,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:06:52,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857481145] [2019-11-28 20:06:52,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:06:52,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:06:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:06:52,639 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 11 states. [2019-11-28 20:06:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:53,265 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2019-11-28 20:06:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:06:53,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-28 20:06:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:53,275 INFO L225 Difference]: With dead ends: 82 [2019-11-28 20:06:53,276 INFO L226 Difference]: Without dead ends: 82 [2019-11-28 20:06:53,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:06:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-28 20:06:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-28 20:06:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:06:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-28 20:06:53,302 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 20 [2019-11-28 20:06:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:53,303 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-28 20:06:53,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:06:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-28 20:06:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:06:53,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:53,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:53,307 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:53,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818779, now seen corresponding path program 1 times [2019-11-28 20:06:53,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:53,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982409313] [2019-11-28 20:06:53,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,466 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:06:53,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982409313] [2019-11-28 20:06:53,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:53,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:06:53,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937531764] [2019-11-28 20:06:53,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:06:53,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:53,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:06:53,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:06:53,470 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2019-11-28 20:06:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:53,759 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2019-11-28 20:06:53,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:06:53,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 20:06:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:53,761 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:06:53,761 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:06:53,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:06:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:06:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 20:06:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 20:06:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-11-28 20:06:53,777 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 21 [2019-11-28 20:06:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:53,778 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-11-28 20:06:53,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:06:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-11-28 20:06:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:06:53,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:53,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:53,781 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1816818778, now seen corresponding path program 1 times [2019-11-28 20:06:53,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:53,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632098560] [2019-11-28 20:06:53,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:54,013 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:06:54,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632098560] [2019-11-28 20:06:54,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:54,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:06:54,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364477325] [2019-11-28 20:06:54,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:06:54,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:54,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:06:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:54,017 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2019-11-28 20:06:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:54,824 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2019-11-28 20:06:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:06:54,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-28 20:06:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:54,826 INFO L225 Difference]: With dead ends: 90 [2019-11-28 20:06:54,827 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 20:06:54,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:06:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 20:06:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2019-11-28 20:06:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 20:06:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2019-11-28 20:06:54,837 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 21 [2019-11-28 20:06:54,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:54,837 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2019-11-28 20:06:54,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:06:54,838 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2019-11-28 20:06:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:06:54,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:54,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:54,839 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash -486807298, now seen corresponding path program 1 times [2019-11-28 20:06:54,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:54,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346975400] [2019-11-28 20:06:54,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:54,998 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:06:55,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346975400] [2019-11-28 20:06:55,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:55,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:06:55,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104647031] [2019-11-28 20:06:55,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:06:55,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:55,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:06:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:06:55,006 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand 10 states. [2019-11-28 20:06:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:55,594 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-28 20:06:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:06:55,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 20:06:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:55,596 INFO L225 Difference]: With dead ends: 87 [2019-11-28 20:06:55,596 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 20:06:55,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:06:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 20:06:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2019-11-28 20:06:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 20:06:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-11-28 20:06:55,606 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 22 [2019-11-28 20:06:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:55,606 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-11-28 20:06:55,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:06:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-11-28 20:06:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:06:55,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:55,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:55,609 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:55,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:55,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1532204726, now seen corresponding path program 1 times [2019-11-28 20:06:55,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:55,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91415110] [2019-11-28 20:06:55,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,674 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:06:55,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91415110] [2019-11-28 20:06:55,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:06:55,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:06:55,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055046440] [2019-11-28 20:06:55,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:06:55,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:06:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:06:55,677 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 6 states. [2019-11-28 20:06:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:55,848 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-11-28 20:06:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:06:55,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-28 20:06:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:55,851 INFO L225 Difference]: With dead ends: 73 [2019-11-28 20:06:55,851 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 20:06:55,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:06:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 20:06:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-28 20:06:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-28 20:06:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-11-28 20:06:55,860 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 28 [2019-11-28 20:06:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:55,860 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-11-28 20:06:55,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:06:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-11-28 20:06:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:06:55,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:55,862 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:06:55,863 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:06:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:06:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1010784573, now seen corresponding path program 1 times [2019-11-28 20:06:55,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:06:55,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333374892] [2019-11-28 20:06:55,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:06:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:56,010 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:06:56,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333374892] [2019-11-28 20:06:56,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427953406] [2019-11-28 20:06:56,012 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:06:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:06:56,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:06:56,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:06:56,400 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:06:56,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:06:56,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-28 20:06:56,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945203336] [2019-11-28 20:06:56,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 20:06:56,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:06:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 20:06:56,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:06:56,404 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 17 states. [2019-11-28 20:06:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:06:59,838 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2019-11-28 20:06:59,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:06:59,839 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-28 20:06:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:06:59,841 INFO L225 Difference]: With dead ends: 135 [2019-11-28 20:06:59,841 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 20:06:59,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-11-28 20:06:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 20:06:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2019-11-28 20:06:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 20:06:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2019-11-28 20:06:59,861 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 30 [2019-11-28 20:06:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:06:59,862 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2019-11-28 20:06:59,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 20:06:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2019-11-28 20:06:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 20:06:59,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:06:59,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:00,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:00,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -725039271, now seen corresponding path program 1 times [2019-11-28 20:07:00,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:00,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759524175] [2019-11-28 20:07:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,188 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:07:00,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759524175] [2019-11-28 20:07:00,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:00,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:07:00,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063434213] [2019-11-28 20:07:00,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:07:00,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:00,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:07:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:07:00,191 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand 7 states. [2019-11-28 20:07:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:00,403 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2019-11-28 20:07:00,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:07:00,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-28 20:07:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:00,408 INFO L225 Difference]: With dead ends: 108 [2019-11-28 20:07:00,409 INFO L226 Difference]: Without dead ends: 96 [2019-11-28 20:07:00,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:07:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-28 20:07:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-11-28 20:07:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 20:07:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2019-11-28 20:07:00,438 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 30 [2019-11-28 20:07:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:00,439 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2019-11-28 20:07:00,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:07:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2019-11-28 20:07:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:07:00,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:00,444 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:00,445 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash -701366204, now seen corresponding path program 1 times [2019-11-28 20:07:00,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:00,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980577487] [2019-11-28 20:07:00,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,742 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:07:00,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980577487] [2019-11-28 20:07:00,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491913355] [2019-11-28 20:07:00,743 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:07:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:00,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 20:07:00,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:01,142 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:07:01,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:07:01,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2019-11-28 20:07:01,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194509624] [2019-11-28 20:07:01,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 20:07:01,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:01,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 20:07:01,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-11-28 20:07:01,145 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 27 states. [2019-11-28 20:07:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:04,055 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2019-11-28 20:07:04,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 20:07:04,056 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 32 [2019-11-28 20:07:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:04,059 INFO L225 Difference]: With dead ends: 187 [2019-11-28 20:07:04,059 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 20:07:04,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=475, Invalid=2495, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 20:07:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 20:07:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2019-11-28 20:07:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 20:07:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 150 transitions. [2019-11-28 20:07:04,075 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 150 transitions. Word has length 32 [2019-11-28 20:07:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:04,075 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-28 20:07:04,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 20:07:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 150 transitions. [2019-11-28 20:07:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 20:07:04,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:04,077 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:04,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:04,280 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:04,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:04,281 INFO L82 PathProgramCache]: Analyzing trace with hash -997384011, now seen corresponding path program 1 times [2019-11-28 20:07:04,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:04,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857858893] [2019-11-28 20:07:04,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:07:04,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857858893] [2019-11-28 20:07:04,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097596300] [2019-11-28 20:07:04,452 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:07:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:04,518 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 20:07:04,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:04,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:07:04,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:04,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:04,578 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:04,578 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:07:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:05,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:07:05,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-28 20:07:05,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436546891] [2019-11-28 20:07:05,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:07:05,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:07:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:07:05,131 INFO L87 Difference]: Start difference. First operand 121 states and 150 transitions. Second operand 21 states. [2019-11-28 20:07:07,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:07,200 INFO L93 Difference]: Finished difference Result 210 states and 251 transitions. [2019-11-28 20:07:07,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 20:07:07,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-28 20:07:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:07,203 INFO L225 Difference]: With dead ends: 210 [2019-11-28 20:07:07,203 INFO L226 Difference]: Without dead ends: 210 [2019-11-28 20:07:07,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=1151, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 20:07:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-28 20:07:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 147. [2019-11-28 20:07:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-28 20:07:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2019-11-28 20:07:07,216 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 33 [2019-11-28 20:07:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:07,216 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2019-11-28 20:07:07,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:07:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2019-11-28 20:07:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:07:07,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:07,218 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:07,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:07,422 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1094393214, now seen corresponding path program 1 times [2019-11-28 20:07:07,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:07,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477017440] [2019-11-28 20:07:07,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:07,663 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:07:07,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477017440] [2019-11-28 20:07:07,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916184724] [2019-11-28 20:07:07,663 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:07:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:07,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 20:07:07,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:07,727 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 7 treesize of output 6 [2019-11-28 20:07:07,728 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:07,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:07,731 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:07,731 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-11-28 20:07:09,870 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_6 Int)) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| v_check_~a.base_BEFORE_CALL_6))) is different from true [2019-11-28 20:07:09,934 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 29 treesize of output 23 [2019-11-28 20:07:09,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:09,939 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:09,940 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:09,940 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:21 [2019-11-28 20:07:09,970 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:07:09,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:07:09,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2019-11-28 20:07:09,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695636773] [2019-11-28 20:07:09,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:07:09,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:07:09,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=418, Unknown=1, NotChecked=40, Total=506 [2019-11-28 20:07:09,972 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 10 states. [2019-11-28 20:07:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:10,158 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-11-28 20:07:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:07:10,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-28 20:07:10,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:10,160 INFO L225 Difference]: With dead ends: 85 [2019-11-28 20:07:10,160 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 20:07:10,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=60, Invalid=543, Unknown=1, NotChecked=46, Total=650 [2019-11-28 20:07:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 20:07:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-28 20:07:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 20:07:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-11-28 20:07:10,167 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 32 [2019-11-28 20:07:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:10,167 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-11-28 20:07:10,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:07:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-11-28 20:07:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 20:07:10,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:10,169 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:10,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:10,372 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash -854133297, now seen corresponding path program 1 times [2019-11-28 20:07:10,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:10,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611412141] [2019-11-28 20:07:10,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:07:10,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611412141] [2019-11-28 20:07:10,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320170252] [2019-11-28 20:07:10,532 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:07:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:10,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 20:07:10,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:10,592 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:07:10,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:10,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:10,597 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:10,598 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:07:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:07:10,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:07:10,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2019-11-28 20:07:10,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262012621] [2019-11-28 20:07:10,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:07:10,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:10,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:07:10,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:07:10,955 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 21 states. [2019-11-28 20:07:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:12,349 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2019-11-28 20:07:12,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 20:07:12,350 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-28 20:07:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:12,352 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:07:12,352 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 20:07:12,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 20:07:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 20:07:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-11-28 20:07:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 20:07:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-28 20:07:12,362 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2019-11-28 20:07:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:12,362 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-28 20:07:12,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:07:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-28 20:07:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 20:07:12,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:12,366 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:12,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:12,567 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1410938279, now seen corresponding path program 1 times [2019-11-28 20:07:12,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:12,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88942054] [2019-11-28 20:07:12,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:07:13,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88942054] [2019-11-28 20:07:13,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318001505] [2019-11-28 20:07:13,055 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:07:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:13,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-28 20:07:13,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:13,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-28 20:07:13,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:13,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:13,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:13,135 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:07:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 20:07:13,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:07:13,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2019-11-28 20:07:13,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445906020] [2019-11-28 20:07:13,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 20:07:13,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:13,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 20:07:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2019-11-28 20:07:13,707 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 32 states. [2019-11-28 20:07:14,851 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-28 20:07:15,253 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-28 20:07:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:15,968 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2019-11-28 20:07:15,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 20:07:15,969 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-11-28 20:07:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:15,970 INFO L225 Difference]: With dead ends: 91 [2019-11-28 20:07:15,970 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 20:07:15,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2019-11-28 20:07:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 20:07:15,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-11-28 20:07:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 20:07:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-28 20:07:15,976 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 45 [2019-11-28 20:07:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:15,976 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-28 20:07:15,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 20:07:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-28 20:07:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 20:07:15,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:15,978 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:16,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:16,182 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, checkErr2REQUIRES_VIOLATION, checkErr3REQUIRES_VIOLATION, checkErr4REQUIRES_VIOLATION, checkErr5REQUIRES_VIOLATION, checkErr0REQUIRES_VIOLATION, checkErr6REQUIRES_VIOLATION, checkErr1REQUIRES_VIOLATION, checkErr7REQUIRES_VIOLATION]=== [2019-11-28 20:07:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:16,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1674201326, now seen corresponding path program 1 times [2019-11-28 20:07:16,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:16,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149591015] [2019-11-28 20:07:16,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 20:07:16,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149591015] [2019-11-28 20:07:16,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340777767] [2019-11-28 20:07:16,500 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:07:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:16,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 20:07:16,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:07:16,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:07:16,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2019-11-28 20:07:16,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861470415] [2019-11-28 20:07:16,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 20:07:16,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:16,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 20:07:16,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2019-11-28 20:07:16,909 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2019-11-28 20:07:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:19,136 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-28 20:07:19,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 20:07:19,137 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-11-28 20:07:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:19,137 INFO L225 Difference]: With dead ends: 66 [2019-11-28 20:07:19,137 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:07:19,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=410, Invalid=2452, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 20:07:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:07:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:07:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:07:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:07:19,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-11-28 20:07:19,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:19,139 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:07:19,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 20:07:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:07:19,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:07:19,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:07:19,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:07:19 BoogieIcfgContainer [2019-11-28 20:07:19,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:07:19,349 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:07:19,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:07:19,349 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:07:19,349 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:06:50" (3/4) ... [2019-11-28 20:07:19,352 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:07:19,357 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:07:19,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:07:19,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-28 20:07:19,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2019-11-28 20:07:19,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-28 20:07:19,364 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-11-28 20:07:19,365 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 20:07:19,365 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:07:19,366 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:07:19,416 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:07:19,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:07:19,418 INFO L168 Benchmark]: Toolchain (without parser) took 29478.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 397.4 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 260.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:19,419 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:19,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:19,420 INFO L168 Benchmark]: Boogie Preprocessor took 49.32 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:19,421 INFO L168 Benchmark]: RCFGBuilder took 483.18 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:19,422 INFO L168 Benchmark]: TraceAbstraction took 28529.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.8 MB). Peak memory consumption was 252.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:19,422 INFO L168 Benchmark]: Witness Printer took 68.38 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:19,425 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.53 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.32 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 483.18 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28529.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.8 MB). Peak memory consumption was 252.4 MB. Max. memory is 11.5 GB. * Witness Printer took 68.38 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 44]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 47]: free always succeeds For all program executions holds that free 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: 28]: 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: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: 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: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 16 error locations. Result: SAFE, OverallTime: 28.4s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 511 SDtfs, 2284 SDslu, 1187 SDs, 0 SdLazy, 7256 SolverSat, 1128 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 291 SyntacticMatches, 14 SemanticMatches, 364 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=11, 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, 15 MinimizatonAttempts, 220 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 682 ConstructedInterpolants, 68 QuantifiedInterpolants, 185721 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1278 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 59/126 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...