./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/freeAlloca.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/memsafety-ext3/freeAlloca.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 bd24d7b29a77a6b0da9f8cbc1fae4e00216bc104 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 03:56:00,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 03:56:00,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 03:56:00,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 03:56:00,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 03:56:00,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 03:56:00,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 03:56:00,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 03:56:00,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 03:56:00,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 03:56:00,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 03:56:00,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 03:56:00,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 03:56:00,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 03:56:00,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 03:56:00,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 03:56:00,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 03:56:00,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 03:56:00,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 03:56:00,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 03:56:00,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 03:56:00,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 03:56:00,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 03:56:00,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 03:56:00,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 03:56:00,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 03:56:00,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 03:56:00,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 03:56:00,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 03:56:00,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 03:56:00,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 03:56:00,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 03:56:00,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 03:56:00,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 03:56:00,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 03:56:00,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 03:56:00,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 03:56:00,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 03:56:00,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 03:56:00,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 03:56:00,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 03:56:00,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-10-26 03:56:00,819 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 03:56:00,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 03:56:00,821 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 03:56:00,821 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 03:56:00,822 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 03:56:00,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 03:56:00,822 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 03:56:00,823 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 03:56:00,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 03:56:00,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 03:56:00,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 03:56:00,824 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-26 03:56:00,824 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-26 03:56:00,824 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-26 03:56:00,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 03:56:00,825 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-26 03:56:00,825 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 03:56:00,825 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 03:56:00,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 03:56:00,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 03:56:00,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 03:56:00,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 03:56:00,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 03:56:00,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 03:56:00,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 03:56:00,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 03:56:00,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 03:56:00,829 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 03:56:00,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> bd24d7b29a77a6b0da9f8cbc1fae4e00216bc104 [2020-10-26 03:56:01,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 03:56:01,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 03:56:01,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 03:56:01,304 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 03:56:01,305 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 03:56:01,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2020-10-26 03:56:01,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1296ac42/cc369a35b7aa4279bff37200ca10d3dc/FLAG7d890a3de [2020-10-26 03:56:01,961 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 03:56:01,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/freeAlloca.c [2020-10-26 03:56:01,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1296ac42/cc369a35b7aa4279bff37200ca10d3dc/FLAG7d890a3de [2020-10-26 03:56:02,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1296ac42/cc369a35b7aa4279bff37200ca10d3dc [2020-10-26 03:56:02,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 03:56:02,343 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-26 03:56:02,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 03:56:02,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 03:56:02,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 03:56:02,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0c3253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02, skipping insertion in model container [2020-10-26 03:56:02,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 03:56:02,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 03:56:02,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:56:02,573 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 03:56:02,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 03:56:02,608 INFO L208 MainTranslator]: Completed translation [2020-10-26 03:56:02,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02 WrapperNode [2020-10-26 03:56:02,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 03:56:02,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 03:56:02,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 03:56:02,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 03:56:02,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (1/1) ... [2020-10-26 03:56:02,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 03:56:02,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 03:56:02,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 03:56:02,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 03:56:02,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 03:56:02,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-26 03:56:02,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 03:56:02,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-26 03:56:02,742 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-26 03:56:02,742 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-26 03:56:02,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-10-26 03:56:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-26 03:56:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 03:56:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 03:56:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 03:56:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 03:56:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-26 03:56:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 03:56:03,064 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 03:56:03,065 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-26 03:56:03,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:56:03 BoogieIcfgContainer [2020-10-26 03:56:03,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 03:56:03,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 03:56:03,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 03:56:03,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 03:56:03,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:56:02" (1/3) ... [2020-10-26 03:56:03,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c301e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:56:03, skipping insertion in model container [2020-10-26 03:56:03,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:56:02" (2/3) ... [2020-10-26 03:56:03,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c301e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:56:03, skipping insertion in model container [2020-10-26 03:56:03,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:56:03" (3/3) ... [2020-10-26 03:56:03,081 INFO L111 eAbstractionObserver]: Analyzing ICFG freeAlloca.c [2020-10-26 03:56:03,095 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 03:56:03,100 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-10-26 03:56:03,129 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-26 03:56:03,181 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 03:56:03,182 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-26 03:56:03,182 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 03:56:03,182 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 03:56:03,183 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 03:56:03,183 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 03:56:03,183 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 03:56:03,183 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 03:56:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-10-26 03:56:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-26 03:56:03,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:03,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:03,231 INFO L429 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash 996996062, now seen corresponding path program 1 times [2020-10-26 03:56:03,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:03,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134454360] [2020-10-26 03:56:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:03,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:03,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134454360] [2020-10-26 03:56:03,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:03,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 03:56:03,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236687360] [2020-10-26 03:56:03,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 03:56:03,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:03,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 03:56:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 03:56:03,623 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-10-26 03:56:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:03,766 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-10-26 03:56:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 03:56:03,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-26 03:56:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:03,778 INFO L225 Difference]: With dead ends: 28 [2020-10-26 03:56:03,778 INFO L226 Difference]: Without dead ends: 25 [2020-10-26 03:56:03,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 03:56:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-26 03:56:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-26 03:56:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-26 03:56:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-10-26 03:56:03,820 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 8 [2020-10-26 03:56:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:03,821 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-26 03:56:03,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 03:56:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-10-26 03:56:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-26 03:56:03,822 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:03,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:03,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 03:56:03,823 INFO L429 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:03,824 INFO L82 PathProgramCache]: Analyzing trace with hash 996995752, now seen corresponding path program 1 times [2020-10-26 03:56:03,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:03,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236310070] [2020-10-26 03:56:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:03,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:03,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236310070] [2020-10-26 03:56:03,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:03,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 03:56:03,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257136509] [2020-10-26 03:56:03,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:03,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:03,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:03,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:03,898 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 4 states. [2020-10-26 03:56:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:03,962 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-10-26 03:56:03,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:03,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-26 03:56:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:03,963 INFO L225 Difference]: With dead ends: 31 [2020-10-26 03:56:03,964 INFO L226 Difference]: Without dead ends: 31 [2020-10-26 03:56:03,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:03,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-26 03:56:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2020-10-26 03:56:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-26 03:56:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-10-26 03:56:03,972 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 8 [2020-10-26 03:56:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:03,972 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-10-26 03:56:03,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-10-26 03:56:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-26 03:56:03,973 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:03,973 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:03,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 03:56:03,974 INFO L429 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:03,975 INFO L82 PathProgramCache]: Analyzing trace with hash 996995806, now seen corresponding path program 1 times [2020-10-26 03:56:03,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:03,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138380694] [2020-10-26 03:56:03,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:04,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138380694] [2020-10-26 03:56:04,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:04,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 03:56:04,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943644081] [2020-10-26 03:56:04,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:04,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:04,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:04,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:04,051 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2020-10-26 03:56:04,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:04,121 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-10-26 03:56:04,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:04,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-26 03:56:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:04,123 INFO L225 Difference]: With dead ends: 30 [2020-10-26 03:56:04,123 INFO L226 Difference]: Without dead ends: 30 [2020-10-26 03:56:04,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-26 03:56:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-10-26 03:56:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 03:56:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-10-26 03:56:04,130 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2020-10-26 03:56:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:04,130 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-10-26 03:56:04,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-10-26 03:56:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-26 03:56:04,132 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:04,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:04,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 03:56:04,133 INFO L429 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:04,133 INFO L82 PathProgramCache]: Analyzing trace with hash 996995805, now seen corresponding path program 1 times [2020-10-26 03:56:04,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:04,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28364180] [2020-10-26 03:56:04,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:04,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28364180] [2020-10-26 03:56:04,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:04,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 03:56:04,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914760554] [2020-10-26 03:56:04,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:04,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:04,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:04,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:04,187 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 4 states. [2020-10-26 03:56:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:04,240 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-10-26 03:56:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:04,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-26 03:56:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:04,242 INFO L225 Difference]: With dead ends: 25 [2020-10-26 03:56:04,242 INFO L226 Difference]: Without dead ends: 25 [2020-10-26 03:56:04,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-26 03:56:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-26 03:56:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-26 03:56:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-10-26 03:56:04,247 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2020-10-26 03:56:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:04,248 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-10-26 03:56:04,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-10-26 03:56:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 03:56:04,249 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:04,249 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:04,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 03:56:04,250 INFO L429 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash 63449068, now seen corresponding path program 1 times [2020-10-26 03:56:04,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:04,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312168618] [2020-10-26 03:56:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-26 03:56:04,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312168618] [2020-10-26 03:56:04,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 03:56:04,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 03:56:04,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572102074] [2020-10-26 03:56:04,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 03:56:04,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 03:56:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:04,343 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 4 states. [2020-10-26 03:56:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:04,436 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-10-26 03:56:04,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 03:56:04,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-26 03:56:04,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:04,438 INFO L225 Difference]: With dead ends: 22 [2020-10-26 03:56:04,438 INFO L226 Difference]: Without dead ends: 22 [2020-10-26 03:56:04,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 03:56:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-10-26 03:56:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-26 03:56:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 03:56:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-10-26 03:56:04,442 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2020-10-26 03:56:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:04,443 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-10-26 03:56:04,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 03:56:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-10-26 03:56:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 03:56:04,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:04,444 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:04,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 03:56:04,444 INFO L429 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:04,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash 63449121, now seen corresponding path program 1 times [2020-10-26 03:56:04,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:04,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801061797] [2020-10-26 03:56:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:04,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801061797] [2020-10-26 03:56:04,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412036464] [2020-10-26 03:56:04,537 INFO L95 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 [2020-10-26 03:56:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:04,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-26 03:56:04,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:04,746 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-26 03:56:04,747 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 03:56:04,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 03:56:04,783 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-26 03:56:04,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-26 03:56:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:04,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:56:04,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 6 [2020-10-26 03:56:04,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266036417] [2020-10-26 03:56:04,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 03:56:04,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 03:56:04,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 03:56:04,818 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2020-10-26 03:56:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:04,896 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-10-26 03:56:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 03:56:04,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-26 03:56:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:04,898 INFO L225 Difference]: With dead ends: 28 [2020-10-26 03:56:04,898 INFO L226 Difference]: Without dead ends: 28 [2020-10-26 03:56:04,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 03:56:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-10-26 03:56:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-10-26 03:56:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-26 03:56:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-10-26 03:56:04,904 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 12 [2020-10-26 03:56:04,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:04,905 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-10-26 03:56:04,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 03:56:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-10-26 03:56:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 03:56:04,906 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:04,906 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:05,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-10-26 03:56:05,108 INFO L429 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:05,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:05,110 INFO L82 PathProgramCache]: Analyzing trace with hash -564445194, now seen corresponding path program 1 times [2020-10-26 03:56:05,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:05,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939640034] [2020-10-26 03:56:05,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:05,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:05,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939640034] [2020-10-26 03:56:05,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251258393] [2020-10-26 03:56:05,207 INFO L95 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 [2020-10-26 03:56:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:05,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-26 03:56:05,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:05,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:56:05,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-10-26 03:56:05,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747975179] [2020-10-26 03:56:05,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 03:56:05,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:05,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 03:56:05,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-26 03:56:05,326 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2020-10-26 03:56:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:05,385 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-10-26 03:56:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 03:56:05,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-26 03:56:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:05,387 INFO L225 Difference]: With dead ends: 35 [2020-10-26 03:56:05,387 INFO L226 Difference]: Without dead ends: 35 [2020-10-26 03:56:05,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-26 03:56:05,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-26 03:56:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-10-26 03:56:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-26 03:56:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-26 03:56:05,393 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 23 [2020-10-26 03:56:05,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:05,394 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-26 03:56:05,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 03:56:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-26 03:56:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:56:05,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:05,395 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:05,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:05,607 INFO L429 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 817658963, now seen corresponding path program 2 times [2020-10-26 03:56:05,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:05,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287357668] [2020-10-26 03:56:05,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:05,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:05,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287357668] [2020-10-26 03:56:05,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729212621] [2020-10-26 03:56:05,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:05,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-26 03:56:05,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 03:56:05,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 03:56:05,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-26 03:56:05,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-26 03:56:05,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2020-10-26 03:56:05,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983751948] [2020-10-26 03:56:05,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 03:56:05,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:05,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 03:56:05,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-26 03:56:05,810 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 5 states. [2020-10-26 03:56:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:05,839 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-10-26 03:56:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 03:56:05,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-26 03:56:05,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:05,841 INFO L225 Difference]: With dead ends: 34 [2020-10-26 03:56:05,841 INFO L226 Difference]: Without dead ends: 32 [2020-10-26 03:56:05,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-26 03:56:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-26 03:56:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-26 03:56:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-26 03:56:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-10-26 03:56:05,846 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 27 [2020-10-26 03:56:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:05,846 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-10-26 03:56:05,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 03:56:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-10-26 03:56:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-26 03:56:05,848 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:05,848 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:06,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:06,058 INFO L429 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:06,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:06,060 INFO L82 PathProgramCache]: Analyzing trace with hash 817651018, now seen corresponding path program 1 times [2020-10-26 03:56:06,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:06,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563099063] [2020-10-26 03:56:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:06,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:06,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563099063] [2020-10-26 03:56:06,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813182558] [2020-10-26 03:56:06,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:06,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-26 03:56:06,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:06,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:56:06,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2020-10-26 03:56:06,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643768875] [2020-10-26 03:56:06,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-26 03:56:06,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-26 03:56:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:56:06,252 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2020-10-26 03:56:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:06,313 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-10-26 03:56:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 03:56:06,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-26 03:56:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:06,314 INFO L225 Difference]: With dead ends: 39 [2020-10-26 03:56:06,314 INFO L226 Difference]: Without dead ends: 39 [2020-10-26 03:56:06,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-26 03:56:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-26 03:56:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-26 03:56:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-26 03:56:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-10-26 03:56:06,319 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2020-10-26 03:56:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:06,320 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-10-26 03:56:06,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-26 03:56:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-10-26 03:56:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-26 03:56:06,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:06,321 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:06,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:06,531 INFO L429 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1120001241, now seen corresponding path program 2 times [2020-10-26 03:56:06,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:06,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80466206] [2020-10-26 03:56:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:06,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:06,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80466206] [2020-10-26 03:56:06,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622123268] [2020-10-26 03:56:06,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:06,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-26 03:56:06,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 03:56:06,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-26 03:56:06,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:06,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:56:06,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-10-26 03:56:06,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768791222] [2020-10-26 03:56:06,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-26 03:56:06,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 03:56:06,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-10-26 03:56:06,730 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 10 states. [2020-10-26 03:56:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:06,802 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-10-26 03:56:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 03:56:06,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-10-26 03:56:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:06,804 INFO L225 Difference]: With dead ends: 43 [2020-10-26 03:56:06,804 INFO L226 Difference]: Without dead ends: 43 [2020-10-26 03:56:06,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-10-26 03:56:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-26 03:56:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-10-26 03:56:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-26 03:56:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2020-10-26 03:56:06,809 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2020-10-26 03:56:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:06,810 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2020-10-26 03:56:06,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-26 03:56:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2020-10-26 03:56:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-26 03:56:06,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:06,811 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:07,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-26 03:56:07,022 INFO L429 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:07,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:07,023 INFO L82 PathProgramCache]: Analyzing trace with hash 92254852, now seen corresponding path program 3 times [2020-10-26 03:56:07,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:07,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918316916] [2020-10-26 03:56:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:07,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:07,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918316916] [2020-10-26 03:56:07,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919886541] [2020-10-26 03:56:07,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:07,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-10-26 03:56:07,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 03:56:07,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-26 03:56:07,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:07,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:56:07,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-10-26 03:56:07,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150804455] [2020-10-26 03:56:07,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-26 03:56:07,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:07,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-26 03:56:07,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-10-26 03:56:07,324 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2020-10-26 03:56:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:07,391 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-10-26 03:56:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-26 03:56:07,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-10-26 03:56:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:07,392 INFO L225 Difference]: With dead ends: 47 [2020-10-26 03:56:07,393 INFO L226 Difference]: Without dead ends: 47 [2020-10-26 03:56:07,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-10-26 03:56:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-26 03:56:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-10-26 03:56:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-26 03:56:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2020-10-26 03:56:07,398 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2020-10-26 03:56:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:07,398 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2020-10-26 03:56:07,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-26 03:56:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-10-26 03:56:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-26 03:56:07,399 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:07,400 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:07,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:07,612 INFO L429 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 696273761, now seen corresponding path program 4 times [2020-10-26 03:56:07,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:07,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113117927] [2020-10-26 03:56:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:07,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:07,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113117927] [2020-10-26 03:56:07,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892998378] [2020-10-26 03:56:07,737 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:07,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-26 03:56:07,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 03:56:07,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-26 03:56:07,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:07,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:56:07,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-10-26 03:56:07,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62654742] [2020-10-26 03:56:07,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 03:56:07,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:07,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 03:56:07,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-10-26 03:56:07,824 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 12 states. [2020-10-26 03:56:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:07,896 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-10-26 03:56:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 03:56:07,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-10-26 03:56:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:07,898 INFO L225 Difference]: With dead ends: 51 [2020-10-26 03:56:07,898 INFO L226 Difference]: Without dead ends: 51 [2020-10-26 03:56:07,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-10-26 03:56:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-26 03:56:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2020-10-26 03:56:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-26 03:56:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-10-26 03:56:07,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 39 [2020-10-26 03:56:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:07,903 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-10-26 03:56:07,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 03:56:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-10-26 03:56:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-26 03:56:07,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:07,904 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:08,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:08,109 INFO L429 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:08,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1214304834, now seen corresponding path program 5 times [2020-10-26 03:56:08,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:08,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278601944] [2020-10-26 03:56:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:08,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:08,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278601944] [2020-10-26 03:56:08,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828336926] [2020-10-26 03:56:08,286 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:08,365 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-10-26 03:56:08,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 03:56:08,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 03:56:08,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:08,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:56:08,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2020-10-26 03:56:08,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223965562] [2020-10-26 03:56:08,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-26 03:56:08,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-26 03:56:08,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-10-26 03:56:08,425 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 13 states. [2020-10-26 03:56:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:08,513 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2020-10-26 03:56:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-26 03:56:08,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2020-10-26 03:56:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:08,515 INFO L225 Difference]: With dead ends: 55 [2020-10-26 03:56:08,515 INFO L226 Difference]: Without dead ends: 55 [2020-10-26 03:56:08,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-10-26 03:56:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-26 03:56:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2020-10-26 03:56:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-26 03:56:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2020-10-26 03:56:08,525 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2020-10-26 03:56:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:08,526 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2020-10-26 03:56:08,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-26 03:56:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2020-10-26 03:56:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-26 03:56:08,528 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:08,529 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:08,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-10-26 03:56:08,739 INFO L429 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:08,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2090572187, now seen corresponding path program 6 times [2020-10-26 03:56:08,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:08,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043876099] [2020-10-26 03:56:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:08,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-26 03:56:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 03:56:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:08,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043876099] [2020-10-26 03:56:08,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806513550] [2020-10-26 03:56:08,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:09,040 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-10-26 03:56:09,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-26 03:56:09,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-26 03:56:09,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 03:56:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 03:56:09,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 03:56:09,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-10-26 03:56:09,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547604998] [2020-10-26 03:56:09,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-26 03:56:09,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 03:56:09,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-26 03:56:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-10-26 03:56:09,084 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 14 states. [2020-10-26 03:56:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 03:56:09,173 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-10-26 03:56:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-26 03:56:09,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2020-10-26 03:56:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 03:56:09,175 INFO L225 Difference]: With dead ends: 56 [2020-10-26 03:56:09,175 INFO L226 Difference]: Without dead ends: 56 [2020-10-26 03:56:09,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2020-10-26 03:56:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-26 03:56:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-26 03:56:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-26 03:56:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2020-10-26 03:56:09,180 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 47 [2020-10-26 03:56:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 03:56:09,181 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2020-10-26 03:56:09,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-26 03:56:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-10-26 03:56:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-26 03:56:09,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 03:56:09,182 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 03:56:09,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 03:56:09,393 INFO L429 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2020-10-26 03:56:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 03:56:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1402261240, now seen corresponding path program 7 times [2020-10-26 03:56:09,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 03:56:09,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076394352] [2020-10-26 03:56:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 03:56:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 03:56:09,449 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 03:56:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 03:56:09,492 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 03:56:09,526 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 03:56:09,526 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 03:56:09,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-26 03:56:09,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 03:56:09 BoogieIcfgContainer [2020-10-26 03:56:09,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 03:56:09,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 03:56:09,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 03:56:09,604 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 03:56:09,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:56:03" (3/4) ... [2020-10-26 03:56:09,607 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 03:56:09,697 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 03:56:09,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 03:56:09,699 INFO L168 Benchmark]: Toolchain (without parser) took 7360.74 ms. Allocated memory was 46.1 MB in the beginning and 100.7 MB in the end (delta: 54.5 MB). Free memory was 23.1 MB in the beginning and 66.6 MB in the end (delta: -43.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:09,703 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 46.1 MB. Free memory was 25.6 MB in the beginning and 25.6 MB in the end (delta: 52.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:56:09,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.30 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.5 MB in the beginning and 33.5 MB in the end (delta: -11.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:09,704 INFO L168 Benchmark]: Boogie Preprocessor took 40.90 ms. Allocated memory is still 56.6 MB. Free memory was 33.3 MB in the beginning and 31.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 03:56:09,704 INFO L168 Benchmark]: RCFGBuilder took 415.33 ms. Allocated memory is still 56.6 MB. Free memory was 31.9 MB in the beginning and 34.9 MB in the end (delta: -3.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:09,705 INFO L168 Benchmark]: TraceAbstraction took 6532.88 ms. Allocated memory was 56.6 MB in the beginning and 100.7 MB in the end (delta: 44.0 MB). Free memory was 34.5 MB in the beginning and 68.7 MB in the end (delta: -34.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:09,705 INFO L168 Benchmark]: Witness Printer took 93.79 ms. Allocated memory is still 100.7 MB. Free memory was 68.7 MB in the beginning and 66.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 03:56:09,708 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.84 ms. Allocated memory is still 46.1 MB. Free memory was 25.6 MB in the beginning and 25.6 MB in the end (delta: 52.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 263.30 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.5 MB in the beginning and 33.5 MB in the end (delta: -11.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.90 ms. Allocated memory is still 56.6 MB. Free memory was 33.3 MB in the beginning and 31.9 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 415.33 ms. Allocated memory is still 56.6 MB. Free memory was 31.9 MB in the beginning and 34.9 MB in the end (delta: -3.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6532.88 ms. Allocated memory was 56.6 MB in the beginning and 100.7 MB in the end (delta: 44.0 MB). Free memory was 34.5 MB in the beginning and 68.7 MB in the end (delta: -34.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * Witness Printer took 93.79 ms. Allocated memory is still 100.7 MB. Free memory was 68.7 MB in the beginning and 66.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L7] char *p = alloca(10 * sizeof(char)); [L9] int i = 0; VAL [alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-1, alloca(10 * sizeof(char))={11:0}, i=0, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-2, alloca(10 * sizeof(char))={11:0}, i=1, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={11:0}, i=2, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-4, alloca(10 * sizeof(char))={11:0}, i=3, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-5, alloca(10 * sizeof(char))={11:0}, i=4, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-6, alloca(10 * sizeof(char))={11:0}, i=5, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-7, alloca(10 * sizeof(char))={11:0}, i=6, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-8, alloca(10 * sizeof(char))={11:0}, i=7, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-9, alloca(10 * sizeof(char))={11:0}, i=8, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] COND TRUE i < 10 [L10] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=-10, alloca(10 * sizeof(char))={11:0}, i=9, p={11:0}] [L9] i++ VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L9] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L13] EXPR p[2] VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}, p[2]=97] [L13] COND TRUE p[2] == 'a' [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] [L14] free(p) VAL [alloca(10 * sizeof(char))={11:0}, i=10, p={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.3s, OverallIterations: 15, TraceHistogramMax: 10, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 215 SDtfs, 205 SDslu, 505 SDs, 0 SdLazy, 592 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 663 NumberOfCodeBlocks, 639 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 589 ConstructedInterpolants, 1 QuantifiedInterpolants, 56614 SizeOfPredicates, 10 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 PerfectInterpolantSequences, 29/1097 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...