./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.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/ldv-memsafety/ArraysWithLenghtAtDeclaration.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 56b28f59847d63942ec468b0c95f39e5b8c0763a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:10:25,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:10:25,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:10:25,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:10:25,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:10:25,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:10:25,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:10:25,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:10:25,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:10:25,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:10:25,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:10:25,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:10:25,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:10:25,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:10:25,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:10:25,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:10:25,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:10:25,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:10:25,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:10:25,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:10:25,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:10:25,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:10:25,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:10:25,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:10:25,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:10:25,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:10:25,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:10:25,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:10:25,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:10:25,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:10:25,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:10:25,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:10:25,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:10:25,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:10:25,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:10:25,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:10:25,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:10:25,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:10:25,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:10:25,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:10:25,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:10:25,568 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:10:25,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:10:25,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:10:25,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:10:25,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:10:25,587 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:10:25,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:10:25,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:10:25,589 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:10:25,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:10:25,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:10:25,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:10:25,591 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:10:25,591 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:10:25,592 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:10:25,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:10:25,592 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:10:25,593 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:10:25,593 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:10:25,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:10:25,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:10:25,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:10:25,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:10:25,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:10:25,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:10:25,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:10:25,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:10:25,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:10:25,596 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:10:25,597 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 -> 56b28f59847d63942ec468b0c95f39e5b8c0763a [2019-11-28 20:10:25,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:10:25,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:10:25,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:10:25,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:10:25,946 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:10:25,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2019-11-28 20:10:26,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5c03b9a/a01ce4cec3f74b17acb33266e564c731/FLAGf854bb765 [2019-11-28 20:10:26,507 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:10:26,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2019-11-28 20:10:26,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5c03b9a/a01ce4cec3f74b17acb33266e564c731/FLAGf854bb765 [2019-11-28 20:10:26,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed5c03b9a/a01ce4cec3f74b17acb33266e564c731 [2019-11-28 20:10:26,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:10:26,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:10:26,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:10:26,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:10:26,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:10:26,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:26" (1/1) ... [2019-11-28 20:10:26,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1629a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:26, skipping insertion in model container [2019-11-28 20:10:26,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:10:26" (1/1) ... [2019-11-28 20:10:26,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:10:26,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:10:27,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:10:27,110 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:10:27,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:10:27,145 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:10:27,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27 WrapperNode [2019-11-28 20:10:27,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:10:27,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:10:27,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:10:27,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:10:27,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (1/1) ... [2019-11-28 20:10:27,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (1/1) ... [2019-11-28 20:10:27,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (1/1) ... [2019-11-28 20:10:27,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (1/1) ... [2019-11-28 20:10:27,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (1/1) ... [2019-11-28 20:10:27,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (1/1) ... [2019-11-28 20:10:27,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (1/1) ... [2019-11-28 20:10:27,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:10:27,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:10:27,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:10:27,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:10:27,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (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:10:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:10:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:10:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 20:10:27,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:10:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 20:10:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:10:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:10:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:10:27,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:10:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:10:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:10:27,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:10:27,627 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:10:27,627 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 20:10:27,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:27 BoogieIcfgContainer [2019-11-28 20:10:27,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:10:27,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:10:27,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:10:27,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:10:27,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:10:26" (1/3) ... [2019-11-28 20:10:27,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebf548f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:27, skipping insertion in model container [2019-11-28 20:10:27,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:10:27" (2/3) ... [2019-11-28 20:10:27,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebf548f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:10:27, skipping insertion in model container [2019-11-28 20:10:27,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:27" (3/3) ... [2019-11-28 20:10:27,645 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration.c [2019-11-28 20:10:27,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:10:27,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 20:10:27,681 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 20:10:27,701 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:10:27,701 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:10:27,701 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:10:27,702 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:10:27,702 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:10:27,702 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:10:27,702 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:10:27,702 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:10:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 20:10:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:10:27,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:27,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:27,728 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 20:10:27,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:27,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794547902] [2019-11-28 20:10:27,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:27,945 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:10:27,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794547902] [2019-11-28 20:10:27,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:27,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:10:27,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967411175] [2019-11-28 20:10:27,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:27,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:27,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:27,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:27,967 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 20:10:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:28,171 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 20:10:28,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:28,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 20:10:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:28,184 INFO L225 Difference]: With dead ends: 58 [2019-11-28 20:10:28,184 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 20:10:28,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:10:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 20:10:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 20:10:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:10:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 20:10:28,244 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 20:10:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:28,245 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 20:10:28,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 20:10:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:10:28,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:28,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:28,248 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:28,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 20:10:28,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:28,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718390785] [2019-11-28 20:10:28,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:28,378 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:10:28,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718390785] [2019-11-28 20:10:28,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:28,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:28,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399411758] [2019-11-28 20:10:28,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:28,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:28,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:28,389 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-28 20:10:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:28,507 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-28 20:10:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:28,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 20:10:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:28,511 INFO L225 Difference]: With dead ends: 49 [2019-11-28 20:10:28,511 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 20:10:28,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:10:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 20:10:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-11-28 20:10:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:10:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 20:10:28,519 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-11-28 20:10:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:28,520 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 20:10:28,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-28 20:10:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:10:28,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:28,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:28,522 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:28,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:28,523 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-11-28 20:10:28,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:28,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175496605] [2019-11-28 20:10:28,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:28,596 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:10:28,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175496605] [2019-11-28 20:10:28,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:28,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:10:28,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436781962] [2019-11-28 20:10:28,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:28,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:28,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:28,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:28,600 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-11-28 20:10:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:28,759 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-28 20:10:28,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:28,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-28 20:10:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:28,761 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:10:28,761 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:10:28,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:10:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 20:10:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:10:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-28 20:10:28,769 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-11-28 20:10:28,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:28,770 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-28 20:10:28,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-28 20:10:28,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:10:28,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:28,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:28,772 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:28,773 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-11-28 20:10:28,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:28,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517488665] [2019-11-28 20:10:28,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:28,884 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:10:28,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517488665] [2019-11-28 20:10:28,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:28,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:10:28,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104830315] [2019-11-28 20:10:28,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:10:28,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:28,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:10:28,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:28,888 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2019-11-28 20:10:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:29,087 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-28 20:10:29,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:10:29,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 20:10:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:29,090 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:10:29,090 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:10:29,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:10:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 20:10:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:10:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 20:10:29,103 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-11-28 20:10:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:29,104 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 20:10:29,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:10:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 20:10:29,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:10:29,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:29,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:29,106 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 20:10:29,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:29,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273785292] [2019-11-28 20:10:29,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,242 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:10:29,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273785292] [2019-11-28 20:10:29,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:29,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:10:29,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678584007] [2019-11-28 20:10:29,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:29,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:29,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:29,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:29,246 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-11-28 20:10:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:29,442 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-11-28 20:10:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:29,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 20:10:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:29,445 INFO L225 Difference]: With dead ends: 60 [2019-11-28 20:10:29,445 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 20:10:29,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:29,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 20:10:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2019-11-28 20:10:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:10:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-28 20:10:29,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 15 [2019-11-28 20:10:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:29,454 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-28 20:10:29,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-11-28 20:10:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:10:29,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:29,456 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:29,456 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:29,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-11-28 20:10:29,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:29,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322665308] [2019-11-28 20:10:29,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,554 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:10:29,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322665308] [2019-11-28 20:10:29,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:29,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:10:29,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618759939] [2019-11-28 20:10:29,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:10:29,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:10:29,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:10:29,558 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 8 states. [2019-11-28 20:10:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:29,793 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-28 20:10:29,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:10:29,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 20:10:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:29,797 INFO L225 Difference]: With dead ends: 70 [2019-11-28 20:10:29,799 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 20:10:29,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 20:10:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-11-28 20:10:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:10:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 20:10:29,811 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-11-28 20:10:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:29,811 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 20:10:29,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:10:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 20:10:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:10:29,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:29,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:29,814 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2019-11-28 20:10:29,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:29,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804772528] [2019-11-28 20:10:29,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:29,919 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:10:29,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804772528] [2019-11-28 20:10:29,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:29,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:10:29,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777608653] [2019-11-28 20:10:29,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:10:29,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:10:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:10:29,921 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-11-28 20:10:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:29,991 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-11-28 20:10:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:29,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 20:10:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:29,992 INFO L225 Difference]: With dead ends: 48 [2019-11-28 20:10:29,993 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 20:10:29,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:10:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 20:10:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 20:10:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:10:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-28 20:10:29,999 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 20 [2019-11-28 20:10:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:29,999 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-28 20:10:29,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:10:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-28 20:10:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:10:30,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:30,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:30,001 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234190, now seen corresponding path program 1 times [2019-11-28 20:10:30,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:30,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35158907] [2019-11-28 20:10:30,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,113 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:10:30,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35158907] [2019-11-28 20:10:30,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:10:30,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:10:30,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813787020] [2019-11-28 20:10:30,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:10:30,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:30,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:10:30,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:10:30,116 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-11-28 20:10:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:30,199 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-11-28 20:10:30,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:10:30,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-28 20:10:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:30,202 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:10:30,202 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 20:10:30,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:10:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 20:10:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-11-28 20:10:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 20:10:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 20:10:30,208 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 20 [2019-11-28 20:10:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:30,208 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 20:10:30,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:10:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 20:10:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:10:30,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:30,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:30,210 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:30,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:30,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2011781567, now seen corresponding path program 1 times [2019-11-28 20:10:30,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:30,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302499886] [2019-11-28 20:10:30,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:30,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302499886] [2019-11-28 20:10:30,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620628253] [2019-11-28 20:10:30,263 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:10:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:10:30,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:10:30,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:30,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 20:10:30,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852265030] [2019-11-28 20:10:30,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:30,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:30,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:30,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:10:30,354 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2019-11-28 20:10:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:30,439 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-11-28 20:10:30,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:30,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 20:10:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:30,441 INFO L225 Difference]: With dead ends: 74 [2019-11-28 20:10:30,441 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 20:10:30,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:10:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 20:10:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2019-11-28 20:10:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 20:10:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-11-28 20:10:30,448 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 26 [2019-11-28 20:10:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:30,448 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-11-28 20:10:30,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-11-28 20:10:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 20:10:30,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:30,450 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:30,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:30,663 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1143280978, now seen corresponding path program 1 times [2019-11-28 20:10:30,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:30,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153350734] [2019-11-28 20:10:30,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:10:30,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153350734] [2019-11-28 20:10:30,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093566532] [2019-11-28 20:10:30,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:30,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 20:10:30,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:10:30,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:30,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-11-28 20:10:30,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066163611] [2019-11-28 20:10:30,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:30,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:30,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:30,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:10:30,873 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2019-11-28 20:10:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:31,013 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-28 20:10:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:31,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-28 20:10:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:31,015 INFO L225 Difference]: With dead ends: 67 [2019-11-28 20:10:31,015 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 20:10:31,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 20:10:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2019-11-28 20:10:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 20:10:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-11-28 20:10:31,030 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2019-11-28 20:10:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:31,030 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-11-28 20:10:31,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-11-28 20:10:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 20:10:31,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:31,031 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:31,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:31,235 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:31,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1735380924, now seen corresponding path program 1 times [2019-11-28 20:10:31,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:31,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846602885] [2019-11-28 20:10:31,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:10:31,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846602885] [2019-11-28 20:10:31,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304935720] [2019-11-28 20:10:31,349 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:10:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:31,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:10:31,392 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 20:10:31,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:31,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-11-28 20:10:31,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461123850] [2019-11-28 20:10:31,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:10:31,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:31,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:10:31,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:31,425 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 11 states. [2019-11-28 20:10:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:31,712 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-11-28 20:10:31,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:10:31,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-11-28 20:10:31,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:31,714 INFO L225 Difference]: With dead ends: 73 [2019-11-28 20:10:31,716 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 20:10:31,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:10:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 20:10:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2019-11-28 20:10:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 20:10:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-11-28 20:10:31,729 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 32 [2019-11-28 20:10:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:31,731 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-11-28 20:10:31,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:10:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2019-11-28 20:10:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 20:10:31,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:31,734 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:31,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:31,936 INFO L410 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:31,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1978883467, now seen corresponding path program 2 times [2019-11-28 20:10:31,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:31,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657577134] [2019-11-28 20:10:31,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:10:32,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657577134] [2019-11-28 20:10:32,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340127080] [2019-11-28 20:10:32,072 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:10:32,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:10:32,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:32,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:10:32,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:10:32,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:32,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-11-28 20:10:32,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493240723] [2019-11-28 20:10:32,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:10:32,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:10:32,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:32,224 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 11 states. [2019-11-28 20:10:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:32,672 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-11-28 20:10:32,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:10:32,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-28 20:10:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:32,674 INFO L225 Difference]: With dead ends: 71 [2019-11-28 20:10:32,674 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 20:10:32,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:10:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 20:10:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-11-28 20:10:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 20:10:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-28 20:10:32,678 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 36 [2019-11-28 20:10:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:32,679 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-28 20:10:32,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:10:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-28 20:10:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 20:10:32,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:32,680 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:32,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:32,884 INFO L410 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1930842354, now seen corresponding path program 3 times [2019-11-28 20:10:32,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:32,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238635572] [2019-11-28 20:10:32,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 20:10:32,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238635572] [2019-11-28 20:10:32,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205152715] [2019-11-28 20:10:32,991 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:10:33,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 20:10:33,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:33,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 20:10:33,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:33,077 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_24|]} [2019-11-28 20:10:33,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:33,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 20:10:33,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:33,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:33,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:33,120 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 20:10:33,120 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:33,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:33,131 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:33,131 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-28 20:10:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 20:10:33,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:33,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-28 20:10:33,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935626878] [2019-11-28 20:10:33,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:10:33,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:10:33,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:10:33,285 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2019-11-28 20:10:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:33,572 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-11-28 20:10:33,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:10:33,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-28 20:10:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:33,574 INFO L225 Difference]: With dead ends: 65 [2019-11-28 20:10:33,574 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 20:10:33,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 20:10:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-28 20:10:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 20:10:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-11-28 20:10:33,578 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2019-11-28 20:10:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:33,579 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-11-28 20:10:33,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:10:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-11-28 20:10:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 20:10:33,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:33,580 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:33,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:33,784 INFO L410 AbstractCegarLoop]: === Iteration 14 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash 492189859, now seen corresponding path program 2 times [2019-11-28 20:10:33,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:33,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621972821] [2019-11-28 20:10:33,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 20:10:33,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621972821] [2019-11-28 20:10:33,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790818034] [2019-11-28 20:10:33,857 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 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:10:33,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:10:33,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:33,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:33,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:33,913 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_13|], 1=[|v_#valid_25|]} [2019-11-28 20:10:33,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:33,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 20:10:33,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:33,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:33,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:10:33,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 20:10:33,933 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:33,939 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:33,940 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:33,940 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-28 20:10:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 20:10:34,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:34,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-28 20:10:34,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356963443] [2019-11-28 20:10:34,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:34,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:34,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:34,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:34,090 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 6 states. [2019-11-28 20:10:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:34,134 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-11-28 20:10:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:10:34,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-28 20:10:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:34,135 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:10:34,136 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 20:10:34,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:10:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 20:10:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-11-28 20:10:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 20:10:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-28 20:10:34,140 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 47 [2019-11-28 20:10:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:34,140 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-28 20:10:34,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-28 20:10:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 20:10:34,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:34,142 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:34,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:34,350 INFO L410 AbstractCegarLoop]: === Iteration 15 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash -190258011, now seen corresponding path program 1 times [2019-11-28 20:10:34,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:34,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032413742] [2019-11-28 20:10:34,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 20:10:34,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032413742] [2019-11-28 20:10:34,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467501275] [2019-11-28 20:10:34,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:10:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:34,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:10:34,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 20:10:34,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:10:34,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 20:10:34,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303000893] [2019-11-28 20:10:34,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:10:34,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:34,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:10:34,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:10:34,574 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 7 states. [2019-11-28 20:10:34,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:34,690 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-11-28 20:10:34,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:34,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-28 20:10:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:34,692 INFO L225 Difference]: With dead ends: 85 [2019-11-28 20:10:34,693 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 20:10:34,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 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:10:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 20:10:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2019-11-28 20:10:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 20:10:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-11-28 20:10:34,706 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 50 [2019-11-28 20:10:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:34,708 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-11-28 20:10:34,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:10:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-11-28 20:10:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 20:10:34,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:10:34,712 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:10:34,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:34,917 INFO L410 AbstractCegarLoop]: === Iteration 16 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 20:10:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:10:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1277143159, now seen corresponding path program 2 times [2019-11-28 20:10:34,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:10:34,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739856474] [2019-11-28 20:10:34,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:10:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:10:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-28 20:10:35,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739856474] [2019-11-28 20:10:35,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199561609] [2019-11-28 20:10:35,089 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 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:10:35,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 20:10:35,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:10:35,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:10:35,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:10:35,233 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:35,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:35,234 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:35,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:35,241 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:35,241 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:35,305 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:35,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:35,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:35,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:35,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:35,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:35,371 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 20:10:35,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 20:10:35,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:10:35,378 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:10:35,379 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:10:35,380 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 20:10:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-28 20:10:35,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:10:35,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2019-11-28 20:10:35,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837230239] [2019-11-28 20:10:35,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:10:35,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:10:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:10:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:10:35,466 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2019-11-28 20:10:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:10:35,560 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-11-28 20:10:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:10:35,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-28 20:10:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:10:35,561 INFO L225 Difference]: With dead ends: 67 [2019-11-28 20:10:35,562 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:10:35,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:10:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:10:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:10:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:10:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:10:35,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2019-11-28 20:10:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:10:35,563 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:10:35,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:10:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:10:35,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:10:35,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:10:35,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:10:35 BoogieIcfgContainer [2019-11-28 20:10:35,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:10:35,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:10:35,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:10:35,771 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:10:35,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:10:27" (3/4) ... [2019-11-28 20:10:35,774 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:10:35,780 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 20:10:35,780 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 20:10:35,780 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 20:10:35,784 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-11-28 20:10:35,784 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 20:10:35,785 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:10:35,785 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:10:35,832 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:10:35,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:10:35,834 INFO L168 Benchmark]: Toolchain (without parser) took 8931.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -238.4 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:35,834 INFO L168 Benchmark]: CDTParser took 0.65 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:10:35,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.01 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 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:10:35,835 INFO L168 Benchmark]: Boogie Preprocessor took 109.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:35,836 INFO L168 Benchmark]: RCFGBuilder took 379.08 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:35,837 INFO L168 Benchmark]: TraceAbstraction took 8132.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.0 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:35,837 INFO L168 Benchmark]: Witness Printer took 61.95 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:10:35,839 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.65 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.01 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 379.08 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8132.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.0 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. * Witness Printer took 61.95 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Result: SAFE, OverallTime: 8.0s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 381 SDtfs, 708 SDslu, 600 SDs, 0 SdLazy, 1567 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 370 SyntacticMatches, 12 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred 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, 16 MinimizatonAttempts, 134 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 784 NumberOfCodeBlocks, 679 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 760 ConstructedInterpolants, 117 QuantifiedInterpolants, 184018 SizeOfPredicates, 10 NumberOfNonLiveVariables, 840 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 430/494 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...