./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3d056a1f 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-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2e9d0e89ee237165e6cd15cb730148b321ca31eb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:59:13,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:59:13,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:59:13,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:59:13,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:59:13,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:59:13,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:59:13,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:59:13,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:59:13,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:59:13,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:59:13,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:59:13,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:59:13,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:59:13,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:59:13,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:59:13,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:59:13,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:59:13,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:59:13,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:59:13,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:59:13,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:59:13,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:59:13,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:59:13,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:59:13,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:59:13,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:59:13,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:59:13,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:59:13,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:59:13,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:59:13,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:59:13,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:59:13,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:59:13,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:59:13,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:59:13,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:59:13,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:59:13,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:59:13,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:59:13,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:59:13,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 13:59:13,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:59:13,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:59:13,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:59:13,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:59:13,891 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:59:13,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:59:13,892 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:59:13,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:59:13,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:59:13,893 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:59:13,893 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:59:13,893 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:59:13,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:59:13,894 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:59:13,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:59:13,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:59:13,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:59:13,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:59:13,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:59:13,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:59:13,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:59:13,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:59:13,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:59:13,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:59:13,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e9d0e89ee237165e6cd15cb730148b321ca31eb [2019-11-22 13:59:14,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:59:14,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:59:14,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:59:14,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:59:14,225 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:59:14,226 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max.c [2019-11-22 13:59:14,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a91346cc/3795d903753b48cc9959aa2fa545b40e/FLAG530f60278 [2019-11-22 13:59:14,803 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:59:14,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2019-11-22 13:59:14,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a91346cc/3795d903753b48cc9959aa2fa545b40e/FLAG530f60278 [2019-11-22 13:59:15,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a91346cc/3795d903753b48cc9959aa2fa545b40e [2019-11-22 13:59:15,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:59:15,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:59:15,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:59:15,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:59:15,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:59:15,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e0ec2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15, skipping insertion in model container [2019-11-22 13:59:15,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:59:15,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:59:15,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:59:15,464 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:59:15,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:59:15,571 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:59:15,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15 WrapperNode [2019-11-22 13:59:15,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:59:15,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:59:15,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:59:15,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:59:15,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (1/1) ... [2019-11-22 13:59:15,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:59:15,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:59:15,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:59:15,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:59:15,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:59:15,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:59:15,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:59:15,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 13:59:15,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:59:15,681 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 13:59:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:59:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:59:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 13:59:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 13:59:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 13:59:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 13:59:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:59:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:59:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 13:59:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 13:59:15,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:59:15,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:59:15,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:59:15,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 13:59:16,065 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:59:16,066 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-22 13:59:16,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:16 BoogieIcfgContainer [2019-11-22 13:59:16,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:59:16,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:59:16,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:59:16,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:59:16,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:59:15" (1/3) ... [2019-11-22 13:59:16,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25987254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:16, skipping insertion in model container [2019-11-22 13:59:16,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:15" (2/3) ... [2019-11-22 13:59:16,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25987254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:16, skipping insertion in model container [2019-11-22 13:59:16,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:16" (3/3) ... [2019-11-22 13:59:16,074 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2019-11-22 13:59:16,083 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:59:16,092 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-22 13:59:16,104 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-22 13:59:16,122 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:59:16,122 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 13:59:16,122 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:59:16,122 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:59:16,122 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:59:16,122 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:59:16,123 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:59:16,123 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:59:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-22 13:59:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 13:59:16,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:16,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:16,150 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-11-22 13:59:16,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:16,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612475, now seen corresponding path program 1 times [2019-11-22 13:59:16,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:16,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713878625] [2019-11-22 13:59:16,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:16,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713878625] [2019-11-22 13:59:16,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:16,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:59:16,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410919369] [2019-11-22 13:59:16,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:16,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:16,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:16,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:16,459 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-22 13:59:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:16,780 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-22 13:59:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 13:59:16,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-22 13:59:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:16,796 INFO L225 Difference]: With dead ends: 46 [2019-11-22 13:59:16,796 INFO L226 Difference]: Without dead ends: 43 [2019-11-22 13:59:16,800 INFO L630 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-11-22 13:59:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-22 13:59:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-22 13:59:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-22 13:59:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-22 13:59:16,849 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2019-11-22 13:59:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:16,850 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-22 13:59:16,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-22 13:59:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 13:59:16,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:16,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:16,852 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-11-22 13:59:16,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:16,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612476, now seen corresponding path program 1 times [2019-11-22 13:59:16,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:16,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985550594] [2019-11-22 13:59:16,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:17,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985550594] [2019-11-22 13:59:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:59:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875633947] [2019-11-22 13:59:17,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:59:17,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:17,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:59:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:59:17,026 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 7 states. [2019-11-22 13:59:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:17,514 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-11-22 13:59:17,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:17,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-22 13:59:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:17,519 INFO L225 Difference]: With dead ends: 89 [2019-11-22 13:59:17,520 INFO L226 Difference]: Without dead ends: 89 [2019-11-22 13:59:17,521 INFO L630 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-11-22 13:59:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-22 13:59:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-11-22 13:59:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-22 13:59:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-11-22 13:59:17,554 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 13 [2019-11-22 13:59:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:17,555 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-11-22 13:59:17,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:59:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-11-22 13:59:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 13:59:17,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:17,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:17,560 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-11-22 13:59:17,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2016377715, now seen corresponding path program 1 times [2019-11-22 13:59:17,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:17,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626231674] [2019-11-22 13:59:17,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:17,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626231674] [2019-11-22 13:59:17,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:17,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:59:17,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365691430] [2019-11-22 13:59:17,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:59:17,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:17,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:59:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:59:17,763 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 7 states. [2019-11-22 13:59:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:18,033 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-11-22 13:59:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:18,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-22 13:59:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:18,036 INFO L225 Difference]: With dead ends: 75 [2019-11-22 13:59:18,036 INFO L226 Difference]: Without dead ends: 75 [2019-11-22 13:59:18,037 INFO L630 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-11-22 13:59:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-22 13:59:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-11-22 13:59:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 13:59:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-22 13:59:18,047 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 14 [2019-11-22 13:59:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:18,048 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-22 13:59:18,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:59:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-22 13:59:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 13:59:18,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:18,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:18,049 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-11-22 13:59:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:18,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2016379159, now seen corresponding path program 1 times [2019-11-22 13:59:18,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:18,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366620286] [2019-11-22 13:59:18,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:18,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366620286] [2019-11-22 13:59:18,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:18,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:59:18,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273301200] [2019-11-22 13:59:18,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:59:18,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:18,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:59:18,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:18,175 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2019-11-22 13:59:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:18,608 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-22 13:59:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:59:18,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-22 13:59:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:18,610 INFO L225 Difference]: With dead ends: 85 [2019-11-22 13:59:18,610 INFO L226 Difference]: Without dead ends: 85 [2019-11-22 13:59:18,611 INFO L630 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-11-22 13:59:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-22 13:59:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 60. [2019-11-22 13:59:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-22 13:59:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-22 13:59:18,619 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 14 [2019-11-22 13:59:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:18,620 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-22 13:59:18,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:59:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-22 13:59:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 13:59:18,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:18,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:18,622 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-11-22 13:59:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1916800304, now seen corresponding path program 1 times [2019-11-22 13:59:18,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:18,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494715584] [2019-11-22 13:59:18,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:18,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494715584] [2019-11-22 13:59:18,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:18,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:59:18,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864526851] [2019-11-22 13:59:18,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:59:18,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:18,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:59:18,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:18,771 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 8 states. [2019-11-22 13:59:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:19,061 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-11-22 13:59:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:59:19,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-22 13:59:19,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:19,064 INFO L225 Difference]: With dead ends: 81 [2019-11-22 13:59:19,064 INFO L226 Difference]: Without dead ends: 81 [2019-11-22 13:59:19,064 INFO L630 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-11-22 13:59:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-22 13:59:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-11-22 13:59:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-22 13:59:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-22 13:59:19,072 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 15 [2019-11-22 13:59:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:19,072 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-22 13:59:19,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:59:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-22 13:59:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 13:59:19,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:19,074 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:19,074 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-11-22 13:59:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:19,075 INFO L82 PathProgramCache]: Analyzing trace with hash 538883906, now seen corresponding path program 1 times [2019-11-22 13:59:19,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:19,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434116152] [2019-11-22 13:59:19,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:19,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434116152] [2019-11-22 13:59:19,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:19,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:59:19,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942444946] [2019-11-22 13:59:19,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:59:19,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:59:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:19,180 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 8 states. [2019-11-22 13:59:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:19,546 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-22 13:59:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:19,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-22 13:59:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:19,547 INFO L225 Difference]: With dead ends: 109 [2019-11-22 13:59:19,547 INFO L226 Difference]: Without dead ends: 109 [2019-11-22 13:59:19,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:59:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-22 13:59:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2019-11-22 13:59:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 13:59:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-22 13:59:19,555 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 17 [2019-11-22 13:59:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:19,555 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-22 13:59:19,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:59:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-22 13:59:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 13:59:19,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:19,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:19,556 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-11-22 13:59:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1823655338, now seen corresponding path program 1 times [2019-11-22 13:59:19,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:19,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457935210] [2019-11-22 13:59:19,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:59:19,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457935210] [2019-11-22 13:59:19,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:19,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 13:59:19,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164448021] [2019-11-22 13:59:19,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:59:19,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:19,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:59:19,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:59:19,649 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2019-11-22 13:59:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:20,082 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-22 13:59:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 13:59:20,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-22 13:59:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:20,084 INFO L225 Difference]: With dead ends: 109 [2019-11-22 13:59:20,084 INFO L226 Difference]: Without dead ends: 109 [2019-11-22 13:59:20,085 INFO L630 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-11-22 13:59:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-22 13:59:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 39. [2019-11-22 13:59:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-22 13:59:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-22 13:59:20,091 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2019-11-22 13:59:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:20,091 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-22 13:59:20,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:59:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-22 13:59:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 13:59:20,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:20,093 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:20,093 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-11-22 13:59:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:20,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1786595156, now seen corresponding path program 1 times [2019-11-22 13:59:20,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:20,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941859121] [2019-11-22 13:59:20,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 13:59:20,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941859121] [2019-11-22 13:59:20,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953856965] [2019-11-22 13:59:20,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 13:59:20,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 13:59:20,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 13:59:20,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-11-22 13:59:20,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678990440] [2019-11-22 13:59:20,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:20,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:20,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:20,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-22 13:59:20,445 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-22 13:59:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:20,570 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-22 13:59:20,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:59:20,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-22 13:59:20,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:20,573 INFO L225 Difference]: With dead ends: 61 [2019-11-22 13:59:20,573 INFO L226 Difference]: Without dead ends: 61 [2019-11-22 13:59:20,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-11-22 13:59:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-22 13:59:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-11-22 13:59:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-22 13:59:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-22 13:59:20,579 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 33 [2019-11-22 13:59:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:20,579 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-22 13:59:20,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-22 13:59:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 13:59:20,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:20,581 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:20,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:20,793 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-11-22 13:59:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash 450123521, now seen corresponding path program 1 times [2019-11-22 13:59:20,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:20,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672769522] [2019-11-22 13:59:20,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 13:59:20,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672769522] [2019-11-22 13:59:20,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:20,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 13:59:20,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379674256] [2019-11-22 13:59:20,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:59:20,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:59:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:59:20,873 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-11-22 13:59:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:20,998 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-22 13:59:20,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 13:59:20,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-22 13:59:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:20,999 INFO L225 Difference]: With dead ends: 51 [2019-11-22 13:59:20,999 INFO L226 Difference]: Without dead ends: 51 [2019-11-22 13:59:21,000 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-22 13:59:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-22 13:59:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-22 13:59:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-22 13:59:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-22 13:59:21,010 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2019-11-22 13:59:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:21,010 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-22 13:59:21,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:59:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-22 13:59:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 13:59:21,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:21,015 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:21,015 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-11-22 13:59:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1222990268, now seen corresponding path program 1 times [2019-11-22 13:59:21,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:21,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165341681] [2019-11-22 13:59:21,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-22 13:59:21,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165341681] [2019-11-22 13:59:21,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:59:21,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 13:59:21,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809035874] [2019-11-22 13:59:21,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 13:59:21,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:21,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 13:59:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:59:21,140 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 7 states. [2019-11-22 13:59:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:21,285 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-22 13:59:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:59:21,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-22 13:59:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:21,287 INFO L225 Difference]: With dead ends: 50 [2019-11-22 13:59:21,287 INFO L226 Difference]: Without dead ends: 34 [2019-11-22 13:59:21,288 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-22 13:59:21,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-22 13:59:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-22 13:59:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-22 13:59:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-22 13:59:21,291 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-11-22 13:59:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:21,292 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-22 13:59:21,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 13:59:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-22 13:59:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 13:59:21,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:59:21,293 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:59:21,293 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-11-22 13:59:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:59:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash 438004402, now seen corresponding path program 1 times [2019-11-22 13:59:21,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 13:59:21,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030776707] [2019-11-22 13:59:21,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 13:59:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 13:59:21,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030776707] [2019-11-22 13:59:21,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972041247] [2019-11-22 13:59:21,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:59:21,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 13:59:21,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:59:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-22 13:59:21,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 13:59:21,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-22 13:59:21,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494991673] [2019-11-22 13:59:21,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-22 13:59:21,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 13:59:21,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-22 13:59:21,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-22 13:59:21,766 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 16 states. [2019-11-22 13:59:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:59:25,127 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2019-11-22 13:59:25,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-22 13:59:25,127 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-11-22 13:59:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:59:25,128 INFO L225 Difference]: With dead ends: 96 [2019-11-22 13:59:25,128 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 13:59:25,130 INFO L630 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-11-22 13:59:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 13:59:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 13:59:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 13:59:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 13:59:25,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-22 13:59:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:59:25,133 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 13:59:25,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-22 13:59:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 13:59:25,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 13:59:25,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 13:59:25,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:59:25 BoogieIcfgContainer [2019-11-22 13:59:25,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 13:59:25,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 13:59:25,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 13:59:25,342 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 13:59:25,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:16" (3/4) ... [2019-11-22 13:59:25,347 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 13:59:25,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 13:59:25,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 13:59:25,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 13:59:25,358 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 13:59:25,367 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-22 13:59:25,367 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 13:59:25,368 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-22 13:59:25,368 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 13:59:25,439 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 13:59:25,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 13:59:25,442 INFO L168 Benchmark]: Toolchain (without parser) took 10275.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.6 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -254.3 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:25,442 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:59:25,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:25,443 INFO L168 Benchmark]: Boogie Preprocessor took 41.06 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:25,444 INFO L168 Benchmark]: RCFGBuilder took 454.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:25,445 INFO L168 Benchmark]: TraceAbstraction took 9273.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:25,445 INFO L168 Benchmark]: Witness Printer took 97.54 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.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-11-22 13:59:25,448 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.06 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 454.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9273.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Witness Printer took 97.54 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.0 MB). Peak memory consumption was 3.0 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.2s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 6.4s, 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.6s 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...