./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 5a079682 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/verifythis/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.24-5a07968 [2019-11-22 11:21:14,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 11:21:14,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 11:21:14,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 11:21:14,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 11:21:14,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 11:21:14,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 11:21:14,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 11:21:14,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 11:21:14,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 11:21:14,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 11:21:14,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 11:21:14,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 11:21:14,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 11:21:14,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 11:21:14,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 11:21:14,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 11:21:14,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 11:21:14,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 11:21:14,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 11:21:14,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 11:21:14,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 11:21:14,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 11:21:14,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 11:21:14,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 11:21:14,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 11:21:14,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 11:21:14,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 11:21:14,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 11:21:14,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 11:21:14,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 11:21:14,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 11:21:14,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 11:21:14,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 11:21:14,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 11:21:14,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 11:21:14,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 11:21:14,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 11:21:14,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 11:21:14,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 11:21:14,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 11:21:14,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-22 11:21:14,978 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 11:21:14,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 11:21:14,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 11:21:14,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 11:21:14,984 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 11:21:14,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 11:21:14,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 11:21:14,986 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 11:21:14,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 11:21:14,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 11:21:14,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 11:21:14,987 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 11:21:14,988 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 11:21:14,989 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 11:21:14,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 11:21:14,990 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 11:21:14,990 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 11:21:14,990 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 11:21:14,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 11:21:14,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 11:21:14,991 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 11:21:14,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 11:21:14,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:21:14,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 11:21:14,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 11:21:14,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 11:21:14,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 11:21:14,993 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-11-22 11:21:15,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 11:21:15,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 11:21:15,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 11:21:15,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 11:21:15,313 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 11:21:15,314 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 11:21:15,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e00ce93/1edbbca339ad48da9ccd0ddecd78df63/FLAG08e8a3003 [2019-11-22 11:21:15,843 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 11:21:15,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2019-11-22 11:21:15,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e00ce93/1edbbca339ad48da9ccd0ddecd78df63/FLAG08e8a3003 [2019-11-22 11:21:16,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e00ce93/1edbbca339ad48da9ccd0ddecd78df63 [2019-11-22 11:21:16,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 11:21:16,238 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 11:21:16,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 11:21:16,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 11:21:16,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 11:21:16,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540a625e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16, skipping insertion in model container [2019-11-22 11:21:16,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 11:21:16,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 11:21:16,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:21:16,488 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 11:21:16,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 11:21:16,586 INFO L208 MainTranslator]: Completed translation [2019-11-22 11:21:16,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16 WrapperNode [2019-11-22 11:21:16,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 11:21:16,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 11:21:16,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 11:21:16,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 11:21:16,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (1/1) ... [2019-11-22 11:21:16,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 11:21:16,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 11:21:16,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 11:21:16,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 11:21:16,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 11:21:16,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 11:21:16,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 11:21:16,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-22 11:21:16,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 11:21:16,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-22 11:21:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 11:21:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 11:21:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 11:21:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-22 11:21:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-22 11:21:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 11:21:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 11:21:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 11:21:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-22 11:21:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 11:21:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 11:21:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 11:21:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 11:21:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 11:21:17,038 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 11:21:17,039 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-22 11:21:17,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:17 BoogieIcfgContainer [2019-11-22 11:21:17,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 11:21:17,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 11:21:17,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 11:21:17,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 11:21:17,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:21:16" (1/3) ... [2019-11-22 11:21:17,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d77216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:21:17, skipping insertion in model container [2019-11-22 11:21:17,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:21:16" (2/3) ... [2019-11-22 11:21:17,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d77216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:21:17, skipping insertion in model container [2019-11-22 11:21:17,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:17" (3/3) ... [2019-11-22 11:21:17,049 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2019-11-22 11:21:17,059 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 11:21:17,065 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-22 11:21:17,075 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-22 11:21:17,099 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 11:21:17,099 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 11:21:17,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 11:21:17,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 11:21:17,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 11:21:17,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 11:21:17,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 11:21:17,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 11:21:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-22 11:21:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 11:21:17,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:17,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:17,128 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 11:21:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612475, now seen corresponding path program 1 times [2019-11-22 11:21:17,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:17,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350131626] [2019-11-22 11:21:17,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:17,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350131626] [2019-11-22 11:21:17,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:17,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:21:17,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819256752] [2019-11-22 11:21:17,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:21:17,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:17,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:21:17,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:21:17,429 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-22 11:21:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:17,679 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-22 11:21:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:21:17,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-22 11:21:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:17,691 INFO L225 Difference]: With dead ends: 46 [2019-11-22 11:21:17,692 INFO L226 Difference]: Without dead ends: 43 [2019-11-22 11:21:17,694 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 11:21:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-22 11:21:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-22 11:21:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-22 11:21:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-22 11:21:17,739 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2019-11-22 11:21:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:17,739 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-22 11:21:17,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:21:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-22 11:21:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-22 11:21:17,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:17,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:17,742 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 11:21:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612476, now seen corresponding path program 1 times [2019-11-22 11:21:17,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:17,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067955277] [2019-11-22 11:21:17,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:17,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067955277] [2019-11-22 11:21:17,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:17,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:17,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103269114] [2019-11-22 11:21:17,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:17,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:17,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:17,890 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 7 states. [2019-11-22 11:21:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:18,385 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-11-22 11:21:18,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:21:18,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-22 11:21:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:18,388 INFO L225 Difference]: With dead ends: 89 [2019-11-22 11:21:18,388 INFO L226 Difference]: Without dead ends: 89 [2019-11-22 11:21:18,390 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 11:21:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-22 11:21:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-11-22 11:21:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-22 11:21:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-11-22 11:21:18,408 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 13 [2019-11-22 11:21:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:18,409 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-11-22 11:21:18,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-11-22 11:21:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 11:21:18,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:18,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:18,414 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 11:21:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2016377715, now seen corresponding path program 1 times [2019-11-22 11:21:18,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:18,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752682053] [2019-11-22 11:21:18,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:18,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752682053] [2019-11-22 11:21:18,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:18,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:18,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337430894] [2019-11-22 11:21:18,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:18,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:18,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:18,608 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 7 states. [2019-11-22 11:21:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:18,874 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-11-22 11:21:18,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:21:18,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-22 11:21:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:18,876 INFO L225 Difference]: With dead ends: 75 [2019-11-22 11:21:18,876 INFO L226 Difference]: Without dead ends: 75 [2019-11-22 11:21:18,877 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 11:21:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-22 11:21:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-11-22 11:21:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-22 11:21:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-22 11:21:18,888 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 14 [2019-11-22 11:21:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:18,889 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-22 11:21:18,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-22 11:21:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-22 11:21:18,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:18,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:18,891 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 11:21:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2016379159, now seen corresponding path program 1 times [2019-11-22 11:21:18,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:18,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464266377] [2019-11-22 11:21:18,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:19,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464266377] [2019-11-22 11:21:19,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:19,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:21:19,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319294164] [2019-11-22 11:21:19,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:21:19,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:19,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:21:19,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:21:19,013 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2019-11-22 11:21:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:19,456 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-22 11:21:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:21:19,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-22 11:21:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:19,458 INFO L225 Difference]: With dead ends: 85 [2019-11-22 11:21:19,459 INFO L226 Difference]: Without dead ends: 85 [2019-11-22 11:21:19,459 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 11:21:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-22 11:21:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 60. [2019-11-22 11:21:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-22 11:21:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-22 11:21:19,468 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 14 [2019-11-22 11:21:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:19,468 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-22 11:21:19,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:21:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-22 11:21:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 11:21:19,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:19,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:19,470 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 11:21:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1916800304, now seen corresponding path program 1 times [2019-11-22 11:21:19,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:19,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881385627] [2019-11-22 11:21:19,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:19,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881385627] [2019-11-22 11:21:19,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:19,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:21:19,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788410196] [2019-11-22 11:21:19,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:21:19,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:21:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:21:19,631 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 8 states. [2019-11-22 11:21:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:19,885 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-11-22 11:21:19,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 11:21:19,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-22 11:21:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:19,888 INFO L225 Difference]: With dead ends: 81 [2019-11-22 11:21:19,888 INFO L226 Difference]: Without dead ends: 81 [2019-11-22 11:21:19,888 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 11:21:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-22 11:21:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-11-22 11:21:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-22 11:21:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-22 11:21:19,897 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 15 [2019-11-22 11:21:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:19,897 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-22 11:21:19,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:21:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-22 11:21:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-22 11:21:19,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:19,898 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 11:21:19,899 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 11:21:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash 538883906, now seen corresponding path program 1 times [2019-11-22 11:21:19,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:19,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677211273] [2019-11-22 11:21:19,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 11:21:19,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677211273] [2019-11-22 11:21:19,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:19,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:21:19,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457935210] [2019-11-22 11:21:19,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:21:19,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:21:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:21:19,982 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 8 states. [2019-11-22 11:21:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:20,350 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-22 11:21:20,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:21:20,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-22 11:21:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:20,353 INFO L225 Difference]: With dead ends: 109 [2019-11-22 11:21:20,353 INFO L226 Difference]: Without dead ends: 109 [2019-11-22 11:21:20,354 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 11:21:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-22 11:21:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2019-11-22 11:21:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-22 11:21:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-22 11:21:20,361 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 17 [2019-11-22 11:21:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:20,361 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-22 11:21:20,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:21:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-22 11:21:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 11:21:20,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:20,363 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 11:21:20,363 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 11:21:20,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1823655338, now seen corresponding path program 1 times [2019-11-22 11:21:20,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:20,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361543389] [2019-11-22 11:21:20,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:20,458 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 11:21:20,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361543389] [2019-11-22 11:21:20,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:20,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-22 11:21:20,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016082301] [2019-11-22 11:21:20,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 11:21:20,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:20,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 11:21:20,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-22 11:21:20,460 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2019-11-22 11:21:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:20,857 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-22 11:21:20,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-22 11:21:20,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-22 11:21:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:20,859 INFO L225 Difference]: With dead ends: 109 [2019-11-22 11:21:20,860 INFO L226 Difference]: Without dead ends: 109 [2019-11-22 11:21:20,860 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 11:21:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-22 11:21:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 39. [2019-11-22 11:21:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-22 11:21:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-22 11:21:20,866 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2019-11-22 11:21:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:20,866 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-22 11:21:20,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 11:21:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-22 11:21:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-22 11:21:20,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:20,868 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 11:21:20,868 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 11:21:20,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1786595156, now seen corresponding path program 1 times [2019-11-22 11:21:20,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:20,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297669569] [2019-11-22 11:21:20,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,004 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 11:21:21,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297669569] [2019-11-22 11:21:21,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127983906] [2019-11-22 11:21:21,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:21:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 11:21:21,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:21:21,200 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 11:21:21,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-22 11:21:21,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-11-22 11:21:21,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786793214] [2019-11-22 11:21:21,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:21:21,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:21:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-22 11:21:21,207 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-22 11:21:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:21,331 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-22 11:21:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 11:21:21,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-22 11:21:21,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:21,334 INFO L225 Difference]: With dead ends: 61 [2019-11-22 11:21:21,334 INFO L226 Difference]: Without dead ends: 61 [2019-11-22 11:21:21,335 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 11:21:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-22 11:21:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-11-22 11:21:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-22 11:21:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-22 11:21:21,346 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 33 [2019-11-22 11:21:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:21,349 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-22 11:21:21,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:21:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-22 11:21:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-22 11:21:21,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:21,351 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 11:21:21,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:21:21,564 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 11:21:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash 450123521, now seen corresponding path program 1 times [2019-11-22 11:21:21,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:21,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844365658] [2019-11-22 11:21:21,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,660 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 11:21:21,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844365658] [2019-11-22 11:21:21,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:21,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-22 11:21:21,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820766161] [2019-11-22 11:21:21,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 11:21:21,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:21,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 11:21:21,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 11:21:21,663 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-11-22 11:21:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:21,807 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-22 11:21:21,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 11:21:21,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-22 11:21:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:21,809 INFO L225 Difference]: With dead ends: 51 [2019-11-22 11:21:21,809 INFO L226 Difference]: Without dead ends: 51 [2019-11-22 11:21:21,810 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 11:21:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-22 11:21:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-22 11:21:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-22 11:21:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-22 11:21:21,822 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2019-11-22 11:21:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:21,822 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-22 11:21:21,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 11:21:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-22 11:21:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-22 11:21:21,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:21,826 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 11:21:21,827 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 11:21:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1222990268, now seen corresponding path program 1 times [2019-11-22 11:21:21,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:21,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311642071] [2019-11-22 11:21:21,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:21,987 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 11:21:21,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311642071] [2019-11-22 11:21:21,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 11:21:21,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 11:21:21,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030776707] [2019-11-22 11:21:21,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 11:21:21,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:21,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 11:21:21,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-22 11:21:21,994 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 7 states. [2019-11-22 11:21:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:22,182 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-22 11:21:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 11:21:22,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-22 11:21:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:22,184 INFO L225 Difference]: With dead ends: 50 [2019-11-22 11:21:22,184 INFO L226 Difference]: Without dead ends: 34 [2019-11-22 11:21:22,185 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 11:21:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-22 11:21:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-22 11:21:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-22 11:21:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-22 11:21:22,188 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-11-22 11:21:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:22,189 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-22 11:21:22,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 11:21:22,189 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-22 11:21:22,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-22 11:21:22,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 11:21:22,191 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 11:21:22,191 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 11:21:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 11:21:22,192 INFO L82 PathProgramCache]: Analyzing trace with hash 438004402, now seen corresponding path program 1 times [2019-11-22 11:21:22,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 11:21:22,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593752974] [2019-11-22 11:21:22,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 11:21:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:22,290 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 11:21:22,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593752974] [2019-11-22 11:21:22,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635771801] [2019-11-22 11:21:22,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:21:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 11:21:22,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-22 11:21:22,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 11:21:22,655 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 11:21:22,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 11:21:22,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-22 11:21:22,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180674595] [2019-11-22 11:21:22,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-22 11:21:22,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 11:21:22,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-22 11:21:22,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-22 11:21:22,659 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 16 states. [2019-11-22 11:21:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 11:21:25,999 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2019-11-22 11:21:25,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-22 11:21:26,000 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-11-22 11:21:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 11:21:26,000 INFO L225 Difference]: With dead ends: 96 [2019-11-22 11:21:26,000 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 11:21:26,002 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 11:21:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 11:21:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 11:21:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 11:21:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 11:21:26,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-22 11:21:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 11:21:26,004 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 11:21:26,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-22 11:21:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 11:21:26,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 11:21:26,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 11:21:26,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:21:26 BoogieIcfgContainer [2019-11-22 11:21:26,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 11:21:26,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 11:21:26,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 11:21:26,212 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 11:21:26,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:21:17" (3/4) ... [2019-11-22 11:21:26,217 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 11:21:26,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 11:21:26,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 11:21:26,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-22 11:21:26,224 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-22 11:21:26,232 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-22 11:21:26,232 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-22 11:21:26,233 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-22 11:21:26,233 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 11:21:26,302 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 11:21:26,304 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 11:21:26,307 INFO L168 Benchmark]: Toolchain (without parser) took 10068.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.3 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -238.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:26,307 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 11:21:26,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:26,309 INFO L168 Benchmark]: Boogie Preprocessor took 50.78 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 11:21:26,312 INFO L168 Benchmark]: RCFGBuilder took 401.45 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.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:26,313 INFO L168 Benchmark]: TraceAbstraction took 9169.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:26,314 INFO L168 Benchmark]: Witness Printer took 92.25 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: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-22 11:21:26,321 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.66 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.78 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 401.45 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.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9169.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.1 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Witness Printer took 92.25 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: 11.5 MB). Peak memory consumption was 11.5 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.3s 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...