./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c1f4b5c4 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.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 2e9d0e89ee237165e6cd15cb730148b321ca31eb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-c1f4b5c [2019-12-08 16:28:00,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 16:28:00,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 16:28:00,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 16:28:00,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 16:28:00,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 16:28:00,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 16:28:00,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 16:28:00,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 16:28:00,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 16:28:00,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 16:28:00,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 16:28:00,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 16:28:00,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 16:28:00,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 16:28:00,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 16:28:00,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 16:28:00,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 16:28:00,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 16:28:00,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 16:28:00,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 16:28:00,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 16:28:00,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 16:28:00,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 16:28:00,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 16:28:00,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 16:28:00,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 16:28:00,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 16:28:00,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 16:28:00,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 16:28:00,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 16:28:00,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 16:28:00,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 16:28:00,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 16:28:00,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 16:28:00,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 16:28:00,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 16:28:00,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 16:28:00,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 16:28:00,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 16:28:00,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 16:28:00,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-08 16:28:00,877 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 16:28:00,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 16:28:00,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 16:28:00,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 16:28:00,880 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 16:28:00,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 16:28:00,882 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 16:28:00,882 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-08 16:28:00,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 16:28:00,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 16:28:00,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 16:28:00,884 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-08 16:28:00,884 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-08 16:28:00,885 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-08 16:28:00,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 16:28:00,886 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-08 16:28:00,886 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 16:28:00,887 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 16:28:00,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 16:28:00,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 16:28:00,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 16:28:00,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 16:28:00,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 16:28:00,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 16:28:00,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 16:28:00,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-08 16:28:00,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-08 16:28:00,890 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 16:28:00,891 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 -> 2e9d0e89ee237165e6cd15cb730148b321ca31eb [2019-12-08 16:28:01,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 16:28:01,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 16:28:01,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 16:28:01,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 16:28:01,244 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 16:28:01,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2019-12-08 16:28:01,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1f51e7a/2565c9489bff412baae3fc431755887a/FLAG92f00cee7 [2019-12-08 16:28:01,816 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 16:28:01,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2019-12-08 16:28:01,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1f51e7a/2565c9489bff412baae3fc431755887a/FLAG92f00cee7 [2019-12-08 16:28:02,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1f51e7a/2565c9489bff412baae3fc431755887a [2019-12-08 16:28:02,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 16:28:02,176 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-08 16:28:02,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 16:28:02,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 16:28:02,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 16:28:02,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce2ed6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02, skipping insertion in model container [2019-12-08 16:28:02,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 16:28:02,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 16:28:02,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:28:02,423 INFO L203 MainTranslator]: Completed pre-run [2019-12-08 16:28:02,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:28:02,531 INFO L208 MainTranslator]: Completed translation [2019-12-08 16:28:02,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02 WrapperNode [2019-12-08 16:28:02,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 16:28:02,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-08 16:28:02,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-08 16:28:02,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-08 16:28:02,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (1/1) ... [2019-12-08 16:28:02,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-08 16:28:02,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-08 16:28:02,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-08 16:28:02,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-08 16:28:02,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (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-12-08 16:28:02,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-08 16:28:02,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-08 16:28:02,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-12-08 16:28:02,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-08 16:28:02,630 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-08 16:28:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-08 16:28:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-08 16:28:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-08 16:28:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-12-08 16:28:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-12-08 16:28:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-08 16:28:02,632 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-08 16:28:02,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-08 16:28:02,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-08 16:28:02,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-08 16:28:02,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-08 16:28:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-08 16:28:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-08 16:28:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-08 16:28:02,998 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-08 16:28:02,999 INFO L287 CfgBuilder]: Removed 2 assume(true) statements. [2019-12-08 16:28:03,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:03 BoogieIcfgContainer [2019-12-08 16:28:03,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-08 16:28:03,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-08 16:28:03,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-08 16:28:03,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-08 16:28:03,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:28:02" (1/3) ... [2019-12-08 16:28:03,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339a009d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:28:03, skipping insertion in model container [2019-12-08 16:28:03,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:02" (2/3) ... [2019-12-08 16:28:03,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339a009d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:28:03, skipping insertion in model container [2019-12-08 16:28:03,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:03" (3/3) ... [2019-12-08 16:28:03,009 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2019-12-08 16:28:03,017 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-08 16:28:03,024 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-08 16:28:03,037 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-08 16:28:03,056 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-08 16:28:03,057 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-08 16:28:03,057 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-08 16:28:03,057 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-08 16:28:03,057 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-08 16:28:03,058 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-08 16:28:03,058 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-08 16:28:03,058 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-08 16:28:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-12-08 16:28:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-08 16:28:03,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:03,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:03,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:03,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612475, now seen corresponding path program 1 times [2019-12-08 16:28:03,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:03,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973339532] [2019-12-08 16:28:03,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:03,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973339532] [2019-12-08 16:28:03,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:03,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 16:28:03,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827603731] [2019-12-08 16:28:03,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 16:28:03,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:03,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 16:28:03,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 16:28:03,365 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-12-08 16:28:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:03,645 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-12-08 16:28:03,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-08 16:28:03,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-08 16:28:03,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:03,657 INFO L225 Difference]: With dead ends: 46 [2019-12-08 16:28:03,658 INFO L226 Difference]: Without dead ends: 43 [2019-12-08 16:28:03,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-12-08 16:28:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-08 16:28:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-08 16:28:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-08 16:28:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-12-08 16:28:03,704 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2019-12-08 16:28:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:03,705 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-12-08 16:28:03,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 16:28:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-12-08 16:28:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-08 16:28:03,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:03,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:03,707 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:03,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:03,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612476, now seen corresponding path program 1 times [2019-12-08 16:28:03,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:03,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299674050] [2019-12-08 16:28:03,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:03,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299674050] [2019-12-08 16:28:03,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:03,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:28:03,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924694076] [2019-12-08 16:28:03,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:28:03,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:28:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:28:03,890 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 7 states. [2019-12-08 16:28:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:04,343 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-12-08 16:28:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:28:04,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-08 16:28:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:04,346 INFO L225 Difference]: With dead ends: 89 [2019-12-08 16:28:04,346 INFO L226 Difference]: Without dead ends: 89 [2019-12-08 16:28:04,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-08 16:28:04,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-08 16:28:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-12-08 16:28:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-08 16:28:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-12-08 16:28:04,362 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 13 [2019-12-08 16:28:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:04,363 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-12-08 16:28:04,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:28:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-12-08 16:28:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-08 16:28:04,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:04,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:04,365 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:04,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2016377715, now seen corresponding path program 1 times [2019-12-08 16:28:04,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:04,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82069751] [2019-12-08 16:28:04,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:04,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82069751] [2019-12-08 16:28:04,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:04,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:28:04,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542582393] [2019-12-08 16:28:04,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:28:04,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:04,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:28:04,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:28:04,551 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 7 states. [2019-12-08 16:28:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:04,813 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-12-08 16:28:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:28:04,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-08 16:28:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:04,818 INFO L225 Difference]: With dead ends: 75 [2019-12-08 16:28:04,818 INFO L226 Difference]: Without dead ends: 75 [2019-12-08 16:28:04,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-08 16:28:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-08 16:28:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-12-08 16:28:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-12-08 16:28:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-12-08 16:28:04,844 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 14 [2019-12-08 16:28:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:04,845 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-12-08 16:28:04,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:28:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-12-08 16:28:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-08 16:28:04,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:04,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:04,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:04,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2016379159, now seen corresponding path program 1 times [2019-12-08 16:28:04,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:04,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274490058] [2019-12-08 16:28:04,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:04,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274490058] [2019-12-08 16:28:04,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:04,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:28:04,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443594580] [2019-12-08 16:28:04,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:28:04,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:04,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:28:04,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:28:04,999 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2019-12-08 16:28:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:05,442 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-12-08 16:28:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 16:28:05,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-08 16:28:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:05,445 INFO L225 Difference]: With dead ends: 85 [2019-12-08 16:28:05,445 INFO L226 Difference]: Without dead ends: 85 [2019-12-08 16:28:05,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-08 16:28:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-08 16:28:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 60. [2019-12-08 16:28:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-08 16:28:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-12-08 16:28:05,457 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 14 [2019-12-08 16:28:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:05,457 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-12-08 16:28:05,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:28:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-12-08 16:28:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-08 16:28:05,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:05,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:05,459 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1916800304, now seen corresponding path program 1 times [2019-12-08 16:28:05,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:05,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322525165] [2019-12-08 16:28:05,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:05,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322525165] [2019-12-08 16:28:05,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:05,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:28:05,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470670293] [2019-12-08 16:28:05,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:28:05,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:05,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:28:05,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:28:05,552 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 8 states. [2019-12-08 16:28:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:05,822 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-12-08 16:28:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-08 16:28:05,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-08 16:28:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:05,824 INFO L225 Difference]: With dead ends: 81 [2019-12-08 16:28:05,824 INFO L226 Difference]: Without dead ends: 81 [2019-12-08 16:28:05,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-08 16:28:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-08 16:28:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-12-08 16:28:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-08 16:28:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-12-08 16:28:05,832 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 15 [2019-12-08 16:28:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:05,833 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-12-08 16:28:05,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:28:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-12-08 16:28:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-08 16:28:05,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:05,835 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:05,835 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash 538883906, now seen corresponding path program 1 times [2019-12-08 16:28:05,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:05,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062908727] [2019-12-08 16:28:05,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:05,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062908727] [2019-12-08 16:28:05,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:05,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:28:05,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287876561] [2019-12-08 16:28:05,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:28:05,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:28:05,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:28:05,953 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 8 states. [2019-12-08 16:28:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:06,320 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-12-08 16:28:06,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:28:06,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-08 16:28:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:06,322 INFO L225 Difference]: With dead ends: 109 [2019-12-08 16:28:06,322 INFO L226 Difference]: Without dead ends: 109 [2019-12-08 16:28:06,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:28:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-08 16:28:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2019-12-08 16:28:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-08 16:28:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-12-08 16:28:06,330 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 17 [2019-12-08 16:28:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:06,330 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-12-08 16:28:06,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:28:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-12-08 16:28:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-08 16:28:06,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:06,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:06,333 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1823655338, now seen corresponding path program 1 times [2019-12-08 16:28:06,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:06,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877476232] [2019-12-08 16:28:06,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:28:06,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877476232] [2019-12-08 16:28:06,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:06,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-08 16:28:06,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143537276] [2019-12-08 16:28:06,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:28:06,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:06,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:28:06,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:28:06,490 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2019-12-08 16:28:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:06,896 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-12-08 16:28:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-08 16:28:06,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-08 16:28:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:06,898 INFO L225 Difference]: With dead ends: 109 [2019-12-08 16:28:06,898 INFO L226 Difference]: Without dead ends: 109 [2019-12-08 16:28:06,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-08 16:28:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-08 16:28:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 39. [2019-12-08 16:28:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-08 16:28:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-12-08 16:28:06,907 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2019-12-08 16:28:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:06,907 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-12-08 16:28:06,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:28:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-12-08 16:28:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-08 16:28:06,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:06,909 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:06,910 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1786595156, now seen corresponding path program 1 times [2019-12-08 16:28:06,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:06,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396420838] [2019-12-08 16:28:06,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-08 16:28:07,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396420838] [2019-12-08 16:28:07,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558629393] [2019-12-08 16:28:07,059 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-12-08 16:28:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-08 16:28:07,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:28:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-08 16:28:07,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-08 16:28:07,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-12-08 16:28:07,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164593896] [2019-12-08 16:28:07,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 16:28:07,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:07,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 16:28:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-08 16:28:07,230 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-12-08 16:28:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:07,345 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-12-08 16:28:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-08 16:28:07,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-08 16:28:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:07,348 INFO L225 Difference]: With dead ends: 61 [2019-12-08 16:28:07,348 INFO L226 Difference]: Without dead ends: 61 [2019-12-08 16:28:07,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-12-08 16:28:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-08 16:28:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-12-08 16:28:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-08 16:28:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-12-08 16:28:07,354 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 33 [2019-12-08 16:28:07,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:07,355 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-12-08 16:28:07,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 16:28:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-12-08 16:28:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-08 16:28:07,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:07,357 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:07,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:28:07,568 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash 450123521, now seen corresponding path program 1 times [2019-12-08 16:28:07,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:07,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757751903] [2019-12-08 16:28:07,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-08 16:28:07,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757751903] [2019-12-08 16:28:07,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:07,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-08 16:28:07,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324802522] [2019-12-08 16:28:07,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-08 16:28:07,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-08 16:28:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-08 16:28:07,652 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-12-08 16:28:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:07,769 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-12-08 16:28:07,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-08 16:28:07,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-08 16:28:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:07,771 INFO L225 Difference]: With dead ends: 51 [2019-12-08 16:28:07,771 INFO L226 Difference]: Without dead ends: 51 [2019-12-08 16:28:07,772 INFO L631 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-12-08 16:28:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-08 16:28:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-08 16:28:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-08 16:28:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-12-08 16:28:07,777 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2019-12-08 16:28:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:07,777 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-12-08 16:28:07,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-08 16:28:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-12-08 16:28:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-08 16:28:07,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:07,779 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:07,780 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1222990268, now seen corresponding path program 1 times [2019-12-08 16:28:07,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:07,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826998368] [2019-12-08 16:28:07,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-08 16:28:07,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826998368] [2019-12-08 16:28:07,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:28:07,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-08 16:28:07,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933431458] [2019-12-08 16:28:07,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-08 16:28:07,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:07,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-08 16:28:07,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-08 16:28:07,889 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 7 states. [2019-12-08 16:28:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:08,043 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-12-08 16:28:08,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:28:08,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-12-08 16:28:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:08,045 INFO L225 Difference]: With dead ends: 50 [2019-12-08 16:28:08,045 INFO L226 Difference]: Without dead ends: 34 [2019-12-08 16:28:08,045 INFO L631 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-12-08 16:28:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-08 16:28:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-08 16:28:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-08 16:28:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-12-08 16:28:08,055 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-12-08 16:28:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:08,055 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-12-08 16:28:08,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-08 16:28:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-12-08 16:28:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-08 16:28:08,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:28:08,056 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:28:08,058 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr15ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-12-08 16:28:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:28:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash 438004402, now seen corresponding path program 1 times [2019-12-08 16:28:08,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-08 16:28:08,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640442068] [2019-12-08 16:28:08,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-08 16:28:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-08 16:28:08,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640442068] [2019-12-08 16:28:08,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817506515] [2019-12-08 16:28:08,159 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-12-08 16:28:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:28:08,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-08 16:28:08,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:28:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-08 16:28:08,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-08 16:28:08,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-12-08 16:28:08,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808637617] [2019-12-08 16:28:08,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-08 16:28:08,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-08 16:28:08,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-08 16:28:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-08 16:28:08,505 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 16 states. [2019-12-08 16:28:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:28:11,948 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2019-12-08 16:28:11,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-08 16:28:11,949 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-12-08 16:28:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:28:11,950 INFO L225 Difference]: With dead ends: 96 [2019-12-08 16:28:11,950 INFO L226 Difference]: Without dead ends: 0 [2019-12-08 16:28:11,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2019-12-08 16:28:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-08 16:28:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-08 16:28:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-08 16:28:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-08 16:28:11,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-12-08 16:28:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:28:11,954 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-08 16:28:11,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-08 16:28:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-08 16:28:11,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-08 16:28:12,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-08 16:28:12,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:28:12 BoogieIcfgContainer [2019-12-08 16:28:12,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-08 16:28:12,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-08 16:28:12,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-08 16:28:12,169 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-08 16:28:12,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:03" (3/4) ... [2019-12-08 16:28:12,177 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-08 16:28:12,185 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-08 16:28:12,187 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-08 16:28:12,188 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-12-08 16:28:12,188 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-08 16:28:12,200 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-12-08 16:28:12,201 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-08 16:28:12,201 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-08 16:28:12,202 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-08 16:28:12,291 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-12-08 16:28:12,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-08 16:28:12,294 INFO L168 Benchmark]: Toolchain (without parser) took 10117.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.9 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -290.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:28:12,294 INFO L168 Benchmark]: CDTParser took 0.39 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-12-08 16:28:12,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-12-08 16:28:12,295 INFO L168 Benchmark]: Boogie Preprocessor took 38.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-12-08 16:28:12,302 INFO L168 Benchmark]: RCFGBuilder took 428.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-12-08 16:28:12,305 INFO L168 Benchmark]: TraceAbstraction took 9166.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -211.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:28:12,306 INFO L168 Benchmark]: Witness Printer took 123.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-08 16:28:12,311 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.39 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 356.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -116.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 428.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9166.35 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -211.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 123.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: 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 5 procedures, 53 locations, 16 error locations. Result: SAFE, OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 327 SDtfs, 964 SDslu, 531 SDs, 0 SdLazy, 1951 SolverSat, 388 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=2, 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, 11 MinimizatonAttempts, 212 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 302 ConstructedInterpolants, 8 QuantifiedInterpolants, 49561 SizeOfPredicates, 7 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 33/39 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...