./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 7c71bc25 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-7c71bc2 [2019-11-25 14:06:11,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 14:06:11,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 14:06:11,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 14:06:11,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 14:06:11,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 14:06:11,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 14:06:11,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 14:06:11,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 14:06:11,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 14:06:11,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 14:06:11,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 14:06:11,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 14:06:11,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 14:06:11,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 14:06:11,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 14:06:11,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 14:06:11,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 14:06:11,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 14:06:11,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 14:06:11,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 14:06:11,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 14:06:11,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 14:06:11,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 14:06:11,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 14:06:11,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 14:06:11,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 14:06:11,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 14:06:11,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 14:06:11,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 14:06:11,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 14:06:11,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 14:06:11,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 14:06:11,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 14:06:11,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 14:06:11,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 14:06:11,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 14:06:11,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 14:06:11,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 14:06:11,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 14:06:11,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 14:06:11,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 14:06:11,746 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 14:06:11,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 14:06:11,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 14:06:11,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 14:06:11,749 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 14:06:11,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 14:06:11,750 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 14:06:11,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 14:06:11,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 14:06:11,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 14:06:11,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 14:06:11,752 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 14:06:11,752 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 14:06:11,753 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 14:06:11,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 14:06:11,753 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 14:06:11,754 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 14:06:11,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 14:06:11,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 14:06:11,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 14:06:11,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 14:06:11,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 14:06:11,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 14:06:11,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 14:06:11,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 14:06:11,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 14:06:11,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 14:06:11,757 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-25 14:06:12,054 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 14:06:12,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 14:06:12,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 14:06:12,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 14:06:12,073 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 14:06:12,074 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-25 14:06:12,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79067ff52/2162ffbe1fb14f7985f1e539842000b7/FLAG1b762a981 [2019-11-25 14:06:12,621 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 14:06:12,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max.c [2019-11-25 14:06:12,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79067ff52/2162ffbe1fb14f7985f1e539842000b7/FLAG1b762a981 [2019-11-25 14:06:13,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79067ff52/2162ffbe1fb14f7985f1e539842000b7 [2019-11-25 14:06:13,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 14:06:13,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 14:06:13,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 14:06:13,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 14:06:13,027 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 14:06:13,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170cd080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13, skipping insertion in model container [2019-11-25 14:06:13,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 14:06:13,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 14:06:13,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 14:06:13,237 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 14:06:13,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 14:06:13,330 INFO L208 MainTranslator]: Completed translation [2019-11-25 14:06:13,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13 WrapperNode [2019-11-25 14:06:13,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 14:06:13,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 14:06:13,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 14:06:13,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 14:06:13,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (1/1) ... [2019-11-25 14:06:13,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 14:06:13,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 14:06:13,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 14:06:13,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 14:06:13,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (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-25 14:06:13,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 14:06:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 14:06:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-25 14:06:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 14:06:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 14:06:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 14:06:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 14:06:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 14:06:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 14:06:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-25 14:06:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 14:06:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 14:06:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 14:06:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 14:06:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 14:06:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 14:06:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 14:06:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 14:06:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 14:06:13,841 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 14:06:13,841 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-25 14:06:13,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:13 BoogieIcfgContainer [2019-11-25 14:06:13,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 14:06:13,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 14:06:13,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 14:06:13,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 14:06:13,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 02:06:13" (1/3) ... [2019-11-25 14:06:13,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44eae648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 02:06:13, skipping insertion in model container [2019-11-25 14:06:13,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:06:13" (2/3) ... [2019-11-25 14:06:13,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44eae648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 02:06:13, skipping insertion in model container [2019-11-25 14:06:13,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:13" (3/3) ... [2019-11-25 14:06:13,850 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2019-11-25 14:06:13,857 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 14:06:13,863 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-25 14:06:13,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-25 14:06:13,893 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 14:06:13,893 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 14:06:13,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 14:06:13,894 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 14:06:13,894 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 14:06:13,894 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 14:06:13,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 14:06:13,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 14:06:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-25 14:06:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 14:06:13,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:13,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:13,921 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-25 14:06:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612475, now seen corresponding path program 1 times [2019-11-25 14:06:13,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:13,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882718356] [2019-11-25 14:06:13,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:14,233 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-25 14:06:14,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882718356] [2019-11-25 14:06:14,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:14,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 14:06:14,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932670157] [2019-11-25 14:06:14,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 14:06:14,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 14:06:14,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 14:06:14,264 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 6 states. [2019-11-25 14:06:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:14,585 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-25 14:06:14,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 14:06:14,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-25 14:06:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:14,600 INFO L225 Difference]: With dead ends: 46 [2019-11-25 14:06:14,601 INFO L226 Difference]: Without dead ends: 43 [2019-11-25 14:06:14,605 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-25 14:06:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-25 14:06:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-25 14:06:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-25 14:06:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-25 14:06:14,661 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 13 [2019-11-25 14:06:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:14,662 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-25 14:06:14,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 14:06:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-25 14:06:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-25 14:06:14,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:14,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:14,665 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-25 14:06:14,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1727612476, now seen corresponding path program 1 times [2019-11-25 14:06:14,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:14,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142902761] [2019-11-25 14:06:14,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:14,855 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-25 14:06:14,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142902761] [2019-11-25 14:06:14,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:14,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:06:14,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78190207] [2019-11-25 14:06:14,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:06:14,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:06:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:06:14,860 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 7 states. [2019-11-25 14:06:15,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:15,351 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-11-25 14:06:15,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:06:15,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-11-25 14:06:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:15,354 INFO L225 Difference]: With dead ends: 89 [2019-11-25 14:06:15,355 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 14:06:15,356 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-25 14:06:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 14:06:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2019-11-25 14:06:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 14:06:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-11-25 14:06:15,371 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 13 [2019-11-25 14:06:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:15,373 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-11-25 14:06:15,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:06:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-11-25 14:06:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 14:06:15,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:15,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:15,377 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-25 14:06:15,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:15,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2016377715, now seen corresponding path program 1 times [2019-11-25 14:06:15,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:15,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859377672] [2019-11-25 14:06:15,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:15,564 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-25 14:06:15,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859377672] [2019-11-25 14:06:15,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:15,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:06:15,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205516323] [2019-11-25 14:06:15,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:06:15,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:15,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:06:15,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:06:15,571 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 7 states. [2019-11-25 14:06:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:15,827 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2019-11-25 14:06:15,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:06:15,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-25 14:06:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:15,830 INFO L225 Difference]: With dead ends: 75 [2019-11-25 14:06:15,830 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 14:06:15,831 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-25 14:06:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 14:06:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-11-25 14:06:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 14:06:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-25 14:06:15,843 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 14 [2019-11-25 14:06:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:15,843 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-25 14:06:15,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:06:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-25 14:06:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 14:06:15,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:15,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:15,849 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-25 14:06:15,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:15,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2016379159, now seen corresponding path program 1 times [2019-11-25 14:06:15,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:15,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534403760] [2019-11-25 14:06:15,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:15,991 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-25 14:06:15,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534403760] [2019-11-25 14:06:15,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:15,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:06:15,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287674178] [2019-11-25 14:06:15,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:06:15,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:06:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:06:15,995 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2019-11-25 14:06:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:16,397 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-11-25 14:06:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 14:06:16,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-25 14:06:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:16,399 INFO L225 Difference]: With dead ends: 85 [2019-11-25 14:06:16,399 INFO L226 Difference]: Without dead ends: 85 [2019-11-25 14:06:16,400 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-25 14:06:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-25 14:06:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 60. [2019-11-25 14:06:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 14:06:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-25 14:06:16,409 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 14 [2019-11-25 14:06:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:16,410 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-25 14:06:16,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:06:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-25 14:06:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 14:06:16,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:16,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:16,412 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-25 14:06:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1916800304, now seen corresponding path program 1 times [2019-11-25 14:06:16,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:16,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302499886] [2019-11-25 14:06:16,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:16,498 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-25 14:06:16,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302499886] [2019-11-25 14:06:16,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:16,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:06:16,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88451792] [2019-11-25 14:06:16,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:06:16,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:16,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:06:16,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:06:16,502 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 8 states. [2019-11-25 14:06:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:16,764 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-11-25 14:06:16,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 14:06:16,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-25 14:06:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:16,767 INFO L225 Difference]: With dead ends: 81 [2019-11-25 14:06:16,767 INFO L226 Difference]: Without dead ends: 81 [2019-11-25 14:06:16,767 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-25 14:06:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-25 14:06:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-11-25 14:06:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 14:06:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-11-25 14:06:16,775 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 15 [2019-11-25 14:06:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:16,776 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-11-25 14:06:16,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:06:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-11-25 14:06:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 14:06:16,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:16,778 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 14:06:16,779 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-25 14:06:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash 538883906, now seen corresponding path program 1 times [2019-11-25 14:06:16,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:16,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007015874] [2019-11-25 14:06:16,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:16,916 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-25 14:06:16,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007015874] [2019-11-25 14:06:16,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:16,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:06:16,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309757261] [2019-11-25 14:06:16,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:06:16,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:16,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:06:16,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:06:16,918 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 8 states. [2019-11-25 14:06:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:17,353 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-25 14:06:17,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:06:17,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-25 14:06:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:17,355 INFO L225 Difference]: With dead ends: 109 [2019-11-25 14:06:17,355 INFO L226 Difference]: Without dead ends: 109 [2019-11-25 14:06:17,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-25 14:06:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-25 14:06:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 55. [2019-11-25 14:06:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-25 14:06:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-11-25 14:06:17,362 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 17 [2019-11-25 14:06:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:17,362 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-11-25 14:06:17,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:06:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-11-25 14:06:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 14:06:17,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:17,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-25 14:06:17,364 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-25 14:06:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1823655338, now seen corresponding path program 1 times [2019-11-25 14:06:17,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:17,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787421248] [2019-11-25 14:06:17,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:17,454 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-25 14:06:17,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787421248] [2019-11-25 14:06:17,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:17,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 14:06:17,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960224411] [2019-11-25 14:06:17,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 14:06:17,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:17,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 14:06:17,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 14:06:17,456 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2019-11-25 14:06:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:17,854 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2019-11-25 14:06:17,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 14:06:17,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-25 14:06:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:17,856 INFO L225 Difference]: With dead ends: 109 [2019-11-25 14:06:17,856 INFO L226 Difference]: Without dead ends: 109 [2019-11-25 14:06:17,856 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-25 14:06:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-25 14:06:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 39. [2019-11-25 14:06:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 14:06:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-25 14:06:17,862 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 19 [2019-11-25 14:06:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:17,862 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-25 14:06:17,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 14:06:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-25 14:06:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 14:06:17,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:17,863 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-25 14:06:17,864 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-25 14:06:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:17,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1786595156, now seen corresponding path program 1 times [2019-11-25 14:06:17,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:17,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739191963] [2019-11-25 14:06:17,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,036 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-25 14:06:18,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739191963] [2019-11-25 14:06:18,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189453317] [2019-11-25 14:06:18,037 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-25 14:06:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 14:06:18,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:18,230 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-25 14:06:18,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 14:06:18,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-11-25 14:06:18,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173929736] [2019-11-25 14:06:18,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 14:06:18,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 14:06:18,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-25 14:06:18,234 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-25 14:06:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:18,343 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-25 14:06:18,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 14:06:18,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-25 14:06:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:18,346 INFO L225 Difference]: With dead ends: 61 [2019-11-25 14:06:18,346 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 14:06:18,347 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-25 14:06:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 14:06:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-11-25 14:06:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-25 14:06:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-25 14:06:18,353 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 33 [2019-11-25 14:06:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:18,353 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-25 14:06:18,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 14:06:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-25 14:06:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 14:06:18,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:18,355 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-25 14:06:18,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:18,559 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-25 14:06:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash 450123521, now seen corresponding path program 1 times [2019-11-25 14:06:18,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:18,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971658270] [2019-11-25 14:06:18,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,666 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-25 14:06:18,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971658270] [2019-11-25 14:06:18,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:18,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 14:06:18,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044658567] [2019-11-25 14:06:18,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 14:06:18,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:18,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 14:06:18,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 14:06:18,668 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-11-25 14:06:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:18,808 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-25 14:06:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 14:06:18,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-25 14:06:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:18,810 INFO L225 Difference]: With dead ends: 51 [2019-11-25 14:06:18,810 INFO L226 Difference]: Without dead ends: 51 [2019-11-25 14:06:18,811 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-25 14:06:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-25 14:06:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-25 14:06:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-25 14:06:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2019-11-25 14:06:18,816 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2019-11-25 14:06:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:18,816 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2019-11-25 14:06:18,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 14:06:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2019-11-25 14:06:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 14:06:18,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:18,818 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-25 14:06:18,818 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-25 14:06:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1222990268, now seen corresponding path program 1 times [2019-11-25 14:06:18,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:18,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437901475] [2019-11-25 14:06:18,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:18,905 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-25 14:06:18,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437901475] [2019-11-25 14:06:18,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 14:06:18,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 14:06:18,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363873401] [2019-11-25 14:06:18,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 14:06:18,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 14:06:18,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 14:06:18,907 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 7 states. [2019-11-25 14:06:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:19,087 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-25 14:06:19,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 14:06:19,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-25 14:06:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:19,088 INFO L225 Difference]: With dead ends: 50 [2019-11-25 14:06:19,089 INFO L226 Difference]: Without dead ends: 34 [2019-11-25 14:06:19,089 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-25 14:06:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-25 14:06:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-25 14:06:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 14:06:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-25 14:06:19,093 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 36 [2019-11-25 14:06:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:19,094 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-25 14:06:19,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 14:06:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-25 14:06:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 14:06:19,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 14:06:19,096 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-25 14:06:19,096 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-25 14:06:19,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 14:06:19,096 INFO L82 PathProgramCache]: Analyzing trace with hash 438004402, now seen corresponding path program 1 times [2019-11-25 14:06:19,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 14:06:19,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441466220] [2019-11-25 14:06:19,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 14:06:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:19,211 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-25 14:06:19,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441466220] [2019-11-25 14:06:19,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745523270] [2019-11-25 14:06:19,212 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-25 14:06:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 14:06:19,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 14:06:19,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 14:06:19,563 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-25 14:06:19,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 14:06:19,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-25 14:06:19,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752052024] [2019-11-25 14:06:19,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-25 14:06:19,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 14:06:19,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 14:06:19,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-25 14:06:19,566 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 16 states. [2019-11-25 14:06:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 14:06:22,871 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2019-11-25 14:06:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-25 14:06:22,872 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2019-11-25 14:06:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 14:06:22,873 INFO L225 Difference]: With dead ends: 96 [2019-11-25 14:06:22,873 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 14:06:22,875 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-25 14:06:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 14:06:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 14:06:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 14:06:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 14:06:22,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-25 14:06:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 14:06:22,876 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 14:06:22,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-25 14:06:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 14:06:22,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 14:06:23,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 14:06:23,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 02:06:23 BoogieIcfgContainer [2019-11-25 14:06:23,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 14:06:23,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 14:06:23,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 14:06:23,089 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 14:06:23,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:06:13" (3/4) ... [2019-11-25 14:06:23,095 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 14:06:23,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 14:06:23,103 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 14:06:23,103 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-11-25 14:06:23,103 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 14:06:23,117 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-25 14:06:23,118 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 14:06:23,118 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 14:06:23,118 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 14:06:23,199 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 14:06:23,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 14:06:23,206 INFO L168 Benchmark]: Toolchain (without parser) took 10186.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 273.2 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -250.1 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:23,207 INFO L168 Benchmark]: CDTParser took 0.25 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-25 14:06:23,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:23,208 INFO L168 Benchmark]: Boogie Preprocessor took 43.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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:23,211 INFO L168 Benchmark]: RCFGBuilder took 466.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:23,212 INFO L168 Benchmark]: TraceAbstraction took 9242.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.7 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:23,212 INFO L168 Benchmark]: Witness Printer took 116.82 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.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-11-25 14:06:23,218 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.25 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 309.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 466.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9242.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.7 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Witness Printer took 116.82 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.8 MB). Peak memory consumption was 11.8 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.3s 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...