./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/realloc1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/realloc1.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 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:19:08,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:19:08,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:19:08,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:19:08,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:19:08,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:19:08,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:19:08,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:19:08,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:19:08,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:19:08,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:19:08,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:19:08,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:19:08,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:19:08,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:19:08,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:19:08,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:19:08,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:19:08,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:19:08,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:19:08,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:19:08,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:19:08,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:19:08,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:19:08,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:19:08,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:19:08,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:19:08,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:19:08,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:19:08,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:19:08,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:19:08,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:19:08,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:19:08,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:19:08,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:19:08,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:19:08,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:19:08,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:19:08,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:19:08,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:19:08,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:19:08,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:19:08,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:19:08,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:19:08,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:19:08,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:19:08,586 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:19:08,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:19:08,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:19:08,587 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:19:08,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:19:08,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:19:08,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:19:08,588 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:19:08,589 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:19:08,589 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:19:08,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:19:08,589 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:19:08,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:19:08,590 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:19:08,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:19:08,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:19:08,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:19:08,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:19:08,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:08,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:19:08,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:19:08,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:19:08,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:19:08,593 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:19:08,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 [2019-11-28 20:19:08,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:19:08,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:19:08,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:19:08,929 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:19:08,929 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:19:08,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/realloc1.c [2019-11-28 20:19:08,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a0556e5/b6e8cc8548a14972a671471e9782d8b2/FLAG2d59a792a [2019-11-28 20:19:09,473 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:19:09,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/realloc1.c [2019-11-28 20:19:09,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a0556e5/b6e8cc8548a14972a671471e9782d8b2/FLAG2d59a792a [2019-11-28 20:19:09,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a0556e5/b6e8cc8548a14972a671471e9782d8b2 [2019-11-28 20:19:09,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:19:09,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:19:09,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:09,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:19:09,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:19:09,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:09" (1/1) ... [2019-11-28 20:19:09,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495d7f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:09, skipping insertion in model container [2019-11-28 20:19:09,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:19:09" (1/1) ... [2019-11-28 20:19:09,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:19:09,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:19:10,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:10,126 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:19:10,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:19:10,158 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:19:10,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10 WrapperNode [2019-11-28 20:19:10,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:19:10,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:19:10,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:19:10,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:19:10,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (1/1) ... [2019-11-28 20:19:10,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (1/1) ... [2019-11-28 20:19:10,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (1/1) ... [2019-11-28 20:19:10,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (1/1) ... [2019-11-28 20:19:10,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (1/1) ... [2019-11-28 20:19:10,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (1/1) ... [2019-11-28 20:19:10,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (1/1) ... [2019-11-28 20:19:10,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:19:10,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:19:10,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:19:10,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:19:10,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:19:10,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:19:10,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:19:10,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:19:10,327 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-11-28 20:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-28 20:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-11-28 20:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:19:10,631 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:19:10,631 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 20:19:10,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:10 BoogieIcfgContainer [2019-11-28 20:19:10,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:19:10,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:19:10,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:19:10,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:19:10,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:19:09" (1/3) ... [2019-11-28 20:19:10,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f218cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:10, skipping insertion in model container [2019-11-28 20:19:10,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:19:10" (2/3) ... [2019-11-28 20:19:10,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f218cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:19:10, skipping insertion in model container [2019-11-28 20:19:10,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:10" (3/3) ... [2019-11-28 20:19:10,652 INFO L109 eAbstractionObserver]: Analyzing ICFG realloc1.c [2019-11-28 20:19:10,670 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:19:10,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:19:10,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:19:10,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:19:10,711 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:19:10,711 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:19:10,712 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:19:10,712 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:19:10,712 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:19:10,712 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:19:10,712 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:19:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-28 20:19:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:10,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:10,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:10,738 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:10,743 INFO L82 PathProgramCache]: Analyzing trace with hash 604141221, now seen corresponding path program 1 times [2019-11-28 20:19:10,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:10,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669868200] [2019-11-28 20:19:10,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:10,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669868200] [2019-11-28 20:19:10,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:10,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:19:10,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332700588] [2019-11-28 20:19:10,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:10,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:10,969 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2019-11-28 20:19:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,115 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-28 20:19:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:11,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,126 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:19:11,126 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 20:19:11,128 INFO L630 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 [2019-11-28 20:19:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 20:19:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-11-28 20:19:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 20:19:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-28 20:19:11,170 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 8 [2019-11-28 20:19:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,171 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-28 20:19:11,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-28 20:19:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:11,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,173 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 604141275, now seen corresponding path program 1 times [2019-11-28 20:19:11,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503273878] [2019-11-28 20:19:11,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503273878] [2019-11-28 20:19:11,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:11,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:11,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637063196] [2019-11-28 20:19:11,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:11,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:11,269 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2019-11-28 20:19:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,352 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-11-28 20:19:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:11,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,354 INFO L225 Difference]: With dead ends: 32 [2019-11-28 20:19:11,354 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 20:19:11,356 INFO L630 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 [2019-11-28 20:19:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 20:19:11,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-28 20:19:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 20:19:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-11-28 20:19:11,362 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 8 [2019-11-28 20:19:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,363 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-28 20:19:11,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-11-28 20:19:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:19:11,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,364 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,365 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash 604141276, now seen corresponding path program 1 times [2019-11-28 20:19:11,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76698026] [2019-11-28 20:19:11,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76698026] [2019-11-28 20:19:11,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:11,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:11,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858425748] [2019-11-28 20:19:11,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:11,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:11,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:11,462 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 4 states. [2019-11-28 20:19:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,558 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-28 20:19:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:11,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 20:19:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,559 INFO L225 Difference]: With dead ends: 32 [2019-11-28 20:19:11,560 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 20:19:11,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 20:19:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-28 20:19:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:19:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-28 20:19:11,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2019-11-28 20:19:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,571 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-28 20:19:11,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-28 20:19:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:19:11,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,573 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash -572402136, now seen corresponding path program 1 times [2019-11-28 20:19:11,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102413882] [2019-11-28 20:19:11,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:19:11,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102413882] [2019-11-28 20:19:11,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:11,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:19:11,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018721980] [2019-11-28 20:19:11,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:19:11,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:19:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:19:11,681 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 4 states. [2019-11-28 20:19:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:11,740 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-11-28 20:19:11,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:19:11,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 20:19:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:11,742 INFO L225 Difference]: With dead ends: 32 [2019-11-28 20:19:11,742 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 20:19:11,743 INFO L630 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 [2019-11-28 20:19:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 20:19:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-28 20:19:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 20:19:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-11-28 20:19:11,749 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 12 [2019-11-28 20:19:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:11,750 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-28 20:19:11,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:19:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-11-28 20:19:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:19:11,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:11,751 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:11,752 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash -572402081, now seen corresponding path program 1 times [2019-11-28 20:19:11,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:11,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869927979] [2019-11-28 20:19:11,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:11,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869927979] [2019-11-28 20:19:11,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:19:11,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:19:11,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021843627] [2019-11-28 20:19:11,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:11,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:11,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:11,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:11,922 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2019-11-28 20:19:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:12,007 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-11-28 20:19:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:12,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 20:19:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:12,009 INFO L225 Difference]: With dead ends: 32 [2019-11-28 20:19:12,009 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 20:19:12,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 20:19:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-11-28 20:19:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 20:19:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-28 20:19:12,015 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2019-11-28 20:19:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:12,015 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-28 20:19:12,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-28 20:19:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 20:19:12,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:12,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:12,017 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash -564596971, now seen corresponding path program 1 times [2019-11-28 20:19:12,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:12,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964016788] [2019-11-28 20:19:12,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964016788] [2019-11-28 20:19:12,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759217474] [2019-11-28 20:19:12,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:19:12,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:12,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 20:19:12,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456010603] [2019-11-28 20:19:12,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:19:12,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:12,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:19:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:19:12,196 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-11-28 20:19:12,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:12,280 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-28 20:19:12,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:19:12,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-28 20:19:12,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:12,282 INFO L225 Difference]: With dead ends: 33 [2019-11-28 20:19:12,282 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 20:19:12,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:19:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 20:19:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-28 20:19:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:19:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-28 20:19:12,288 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 13 [2019-11-28 20:19:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:12,289 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-28 20:19:12,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:19:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-28 20:19:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:19:12,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:12,290 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:12,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,502 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1942473074, now seen corresponding path program 2 times [2019-11-28 20:19:12,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:12,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40205908] [2019-11-28 20:19:12,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40205908] [2019-11-28 20:19:12,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632758493] [2019-11-28 20:19:12,583 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:19:12,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:12,617 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:19:12,619 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 20:19:12,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:19:12,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-28 20:19:12,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288588536] [2019-11-28 20:19:12,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:19:12,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:12,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:19:12,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:12,634 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 3 states. [2019-11-28 20:19:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:12,655 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-11-28 20:19:12,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:19:12,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 20:19:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:12,656 INFO L225 Difference]: With dead ends: 32 [2019-11-28 20:19:12,657 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 20:19:12,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 20:19:12,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-28 20:19:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 20:19:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-11-28 20:19:12,661 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 17 [2019-11-28 20:19:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:12,661 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-28 20:19:12,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:19:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-11-28 20:19:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:19:12,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:12,663 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:12,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:12,866 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1594147627, now seen corresponding path program 1 times [2019-11-28 20:19:12,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:12,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265262319] [2019-11-28 20:19:12,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265262319] [2019-11-28 20:19:12,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772170112] [2019-11-28 20:19:12,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 20:19:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:12,964 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:19:12,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:12,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:12,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 20:19:12,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181948465] [2019-11-28 20:19:12,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:19:12,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:12,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:19:12,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:12,986 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2019-11-28 20:19:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:13,046 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-28 20:19:13,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:19:13,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-28 20:19:13,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:13,048 INFO L225 Difference]: With dead ends: 36 [2019-11-28 20:19:13,048 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 20:19:13,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:19:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 20:19:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-11-28 20:19:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 20:19:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-28 20:19:13,053 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2019-11-28 20:19:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:13,054 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-28 20:19:13,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:19:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-28 20:19:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:19:13,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:13,055 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:13,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,259 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash 838999410, now seen corresponding path program 2 times [2019-11-28 20:19:13,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:13,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041811087] [2019-11-28 20:19:13,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041811087] [2019-11-28 20:19:13,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340481165] [2019-11-28 20:19:13,338 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2019-11-28 20:19:13,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:13,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:13,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:19:13,389 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:13,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 20:19:13,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239170557] [2019-11-28 20:19:13,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:19:13,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:13,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:19:13,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:19:13,415 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2019-11-28 20:19:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:13,492 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-11-28 20:19:13,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:19:13,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 20:19:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:13,494 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:19:13,494 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:19:13,494 INFO L630 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 [2019-11-28 20:19:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:19:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-28 20:19:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:19:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-11-28 20:19:13,503 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 23 [2019-11-28 20:19:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:13,503 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-11-28 20:19:13,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:19:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-11-28 20:19:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:19:13,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:13,504 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:13,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:13,709 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:13,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:13,710 INFO L82 PathProgramCache]: Analyzing trace with hash 758998927, now seen corresponding path program 3 times [2019-11-28 20:19:13,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:13,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875481953] [2019-11-28 20:19:13,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875481953] [2019-11-28 20:19:13,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323200456] [2019-11-28 20:19:13,792 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-11-28 20:19:13,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 20:19:13,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:13,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:19:13,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:13,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:13,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-28 20:19:13,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188684165] [2019-11-28 20:19:13,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:19:13,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:19:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:19:13,883 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2019-11-28 20:19:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:13,976 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-11-28 20:19:13,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:19:13,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-28 20:19:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:13,977 INFO L225 Difference]: With dead ends: 44 [2019-11-28 20:19:13,977 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 20:19:13,978 INFO L630 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 [2019-11-28 20:19:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 20:19:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-28 20:19:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:19:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-28 20:19:13,985 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 27 [2019-11-28 20:19:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:13,987 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-28 20:19:13,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:19:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-28 20:19:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:19:13,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:13,988 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:14,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:14,190 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:14,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash 660364076, now seen corresponding path program 4 times [2019-11-28 20:19:14,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:14,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541613647] [2019-11-28 20:19:14,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:14,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541613647] [2019-11-28 20:19:14,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644287978] [2019-11-28 20:19:14,298 INFO L92 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 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 [2019-11-28 20:19:14,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 20:19:14,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:14,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:19:14,372 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:14,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:14,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-28 20:19:14,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526400947] [2019-11-28 20:19:14,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:19:14,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:19:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:19:14,419 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2019-11-28 20:19:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:14,573 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-11-28 20:19:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:19:14,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-28 20:19:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:14,574 INFO L225 Difference]: With dead ends: 48 [2019-11-28 20:19:14,574 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 20:19:14,575 INFO L630 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 [2019-11-28 20:19:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 20:19:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-28 20:19:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:19:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-11-28 20:19:14,579 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 31 [2019-11-28 20:19:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:14,580 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-11-28 20:19:14,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:19:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-11-28 20:19:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 20:19:14,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:14,581 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:14,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:14,783 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:14,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1265514569, now seen corresponding path program 5 times [2019-11-28 20:19:14,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:14,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186163071] [2019-11-28 20:19:14,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:14,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186163071] [2019-11-28 20:19:14,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198763371] [2019-11-28 20:19:14,918 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2019-11-28 20:19:14,976 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-28 20:19:14,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:14,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:19:14,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:14,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:14,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-28 20:19:15,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244355818] [2019-11-28 20:19:15,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:19:15,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:15,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:19:15,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:15,001 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 11 states. [2019-11-28 20:19:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:15,075 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-11-28 20:19:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:19:15,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-28 20:19:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:15,076 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:19:15,077 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 20:19:15,077 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:19:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 20:19:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-28 20:19:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:19:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-11-28 20:19:15,081 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 35 [2019-11-28 20:19:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:15,082 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-11-28 20:19:15,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:19:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-11-28 20:19:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 20:19:15,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:15,084 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:15,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:15,289 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash 719470310, now seen corresponding path program 6 times [2019-11-28 20:19:15,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:15,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679224619] [2019-11-28 20:19:15,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:15,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679224619] [2019-11-28 20:19:15,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583623286] [2019-11-28 20:19:15,398 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2019-11-28 20:19:15,458 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-28 20:19:15,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:15,460 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 20:19:15,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:15,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:15,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-11-28 20:19:15,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711545771] [2019-11-28 20:19:15,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:19:15,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:15,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:19:15,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:19:15,499 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 12 states. [2019-11-28 20:19:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:15,603 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-11-28 20:19:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:19:15,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2019-11-28 20:19:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:15,605 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:19:15,605 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:19:15,605 INFO L630 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 [2019-11-28 20:19:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:19:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-28 20:19:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 20:19:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-11-28 20:19:15,612 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 39 [2019-11-28 20:19:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:15,613 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-11-28 20:19:15,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:19:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-11-28 20:19:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 20:19:15,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:15,618 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:15,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:15,818 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1920487677, now seen corresponding path program 7 times [2019-11-28 20:19:15,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:15,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013215347] [2019-11-28 20:19:15,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:15,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013215347] [2019-11-28 20:19:15,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134445647] [2019-11-28 20:19:15,959 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-11-28 20:19:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:19:16,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:16,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:16,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-28 20:19:16,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464449684] [2019-11-28 20:19:16,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:19:16,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:16,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:19:16,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:19:16,037 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 13 states. [2019-11-28 20:19:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:16,130 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-11-28 20:19:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:19:16,131 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-11-28 20:19:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:16,132 INFO L225 Difference]: With dead ends: 60 [2019-11-28 20:19:16,132 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 20:19:16,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:19:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 20:19:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-11-28 20:19:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 20:19:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-28 20:19:16,138 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 43 [2019-11-28 20:19:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:16,139 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-28 20:19:16,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:19:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-28 20:19:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 20:19:16,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:16,141 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:16,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:16,345 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1099810976, now seen corresponding path program 8 times [2019-11-28 20:19:16,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:16,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327147828] [2019-11-28 20:19:16,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:19:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:16,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327147828] [2019-11-28 20:19:16,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767581154] [2019-11-28 20:19:16,477 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:16,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:19:16,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:19:16,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:19:16,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:19:16,571 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:19:16,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:19:16,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-11-28 20:19:16,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755917973] [2019-11-28 20:19:16,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:19:16,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:19:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:19:16,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:16,576 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 14 states. [2019-11-28 20:19:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:19:16,683 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-11-28 20:19:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:19:16,684 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-28 20:19:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:19:16,685 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:19:16,685 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 20:19:16,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:19:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 20:19:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-28 20:19:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 20:19:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-11-28 20:19:16,690 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 47 [2019-11-28 20:19:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:19:16,691 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-11-28 20:19:16,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:19:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-11-28 20:19:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 20:19:16,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:19:16,692 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:19:16,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:19:16,902 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION]=== [2019-11-28 20:19:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:19:16,902 INFO L82 PathProgramCache]: Analyzing trace with hash -343684163, now seen corresponding path program 9 times [2019-11-28 20:19:16,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:19:16,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208517572] [2019-11-28 20:19:16,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:19:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:19:17,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:19:17,015 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:19:17,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:19:17 BoogieIcfgContainer [2019-11-28 20:19:17,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:19:17,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:19:17,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:19:17,055 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:19:17,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:19:10" (3/4) ... [2019-11-28 20:19:17,058 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:19:17,118 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:19:17,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:19:17,121 INFO L168 Benchmark]: Toolchain (without parser) took 7246.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 961.7 MB in the beginning and 980.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 184.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:17,122 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:17,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.78 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:17,123 INFO L168 Benchmark]: Boogie Preprocessor took 104.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:17,124 INFO L168 Benchmark]: RCFGBuilder took 368.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:17,124 INFO L168 Benchmark]: TraceAbstraction took 6420.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 980.1 MB in the end (delta: 124.6 MB). Peak memory consumption was 187.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:19:17,125 INFO L168 Benchmark]: Witness Printer took 63.88 ms. Allocated memory is still 1.2 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:19:17,128 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.78 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6420.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 980.1 MB in the end (delta: 124.6 MB). Peak memory consumption was 187.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.88 ms. Allocated memory is still 1.2 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=0, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=1, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=2, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=3, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=4, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=5, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=6, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=7, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=8, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=9, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={12:0}, p={12:0}] [L14] free(p) [L16] p[2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 8 error locations. Result: UNSAFE, OverallTime: 6.3s, OverallIterations: 16, TraceHistogramMax: 10, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 297 SDtfs, 243 SDslu, 1004 SDs, 0 SdLazy, 847 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 46 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 687 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 50469 SizeOfPredicates, 10 NumberOfNonLiveVariables, 979 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 9/1065 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...