./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 30f4e4ab 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.24-30f4e4a [2019-11-28 02:37:42,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:37:42,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:37:42,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:37:42,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:37:42,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:37:42,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:37:43,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:37:43,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:37:43,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:37:43,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:37:43,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:37:43,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:37:43,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:37:43,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:37:43,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:37:43,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:37:43,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:37:43,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:37:43,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:37:43,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:37:43,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:37:43,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:37:43,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:37:43,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:37:43,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:37:43,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:37:43,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:37:43,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:37:43,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:37:43,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:37:43,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:37:43,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:37:43,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:37:43,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:37:43,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:37:43,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:37:43,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:37:43,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:37:43,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:37:43,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:37:43,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:37:43,049 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:37:43,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:37:43,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:37:43,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:37:43,051 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:37:43,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:37:43,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:37:43,052 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:37:43,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:37:43,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:37:43,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:37:43,053 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:37:43,054 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:37:43,054 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:37:43,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:37:43,054 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:37:43,055 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:37:43,055 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:37:43,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:37:43,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:37:43,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:37:43,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:37:43,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:37:43,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:37:43,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:37:43,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:37:43,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:37:43,058 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 02:37:43,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:37:43,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:37:43,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:37:43,386 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:37:43,387 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:37:43,387 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 02:37:43,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febe8b255/bd4fd64ecfac4b1bbc789bbbec8563c1/FLAG94e2a8271 [2019-11-28 02:37:43,939 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:37:43,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration.c [2019-11-28 02:37:43,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febe8b255/bd4fd64ecfac4b1bbc789bbbec8563c1/FLAG94e2a8271 [2019-11-28 02:37:44,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febe8b255/bd4fd64ecfac4b1bbc789bbbec8563c1 [2019-11-28 02:37:44,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:37:44,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:37:44,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:44,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:37:44,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:37:44,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c5318a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44, skipping insertion in model container [2019-11-28 02:37:44,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:37:44,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:37:44,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:44,485 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:37:44,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:44,514 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:37:44,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44 WrapperNode [2019-11-28 02:37:44,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:44,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:37:44,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:37:44,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:37:44,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (1/1) ... [2019-11-28 02:37:44,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:37:44,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:37:44,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:37:44,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:37:44,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (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 02:37:44,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:37:44,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:37:44,685 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 02:37:44,685 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:37:44,685 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 02:37:44,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:37:44,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:37:44,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:37:44,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:37:44,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:37:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:37:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:37:44,947 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:37:44,947 INFO L297 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 02:37:44,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:44 BoogieIcfgContainer [2019-11-28 02:37:44,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:37:44,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:37:44,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:37:44,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:37:44,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:37:44" (1/3) ... [2019-11-28 02:37:44,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b00f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:44, skipping insertion in model container [2019-11-28 02:37:44,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:44" (2/3) ... [2019-11-28 02:37:44,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b00f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:44, skipping insertion in model container [2019-11-28 02:37:44,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:44" (3/3) ... [2019-11-28 02:37:44,962 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration.c [2019-11-28 02:37:44,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:37:44,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 02:37:45,010 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 02:37:45,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:37:45,037 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:37:45,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:37:45,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:37:45,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:37:45,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:37:45,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:37:45,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:37:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 02:37:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:37:45,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:45,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:45,077 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 02:37:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:45,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 02:37:45,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:45,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565696174] [2019-11-28 02:37:45,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,344 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 02:37:45,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565696174] [2019-11-28 02:37:45,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:45,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:37:45,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093329833] [2019-11-28 02:37:45,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:45,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:45,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:45,367 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 02:37:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:45,575 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 02:37:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:45,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:37:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:45,589 INFO L225 Difference]: With dead ends: 58 [2019-11-28 02:37:45,589 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:37:45,600 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 02:37:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:37:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 02:37:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 02:37:45,644 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 02:37:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:45,644 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 02:37:45,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 02:37:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:37:45,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:45,646 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:45,646 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 02:37:45,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 02:37:45,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:45,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944723216] [2019-11-28 02:37:45,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,731 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 02:37:45,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944723216] [2019-11-28 02:37:45,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:45,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:45,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195174326] [2019-11-28 02:37:45,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:45,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:45,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:45,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:45,738 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-28 02:37:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:45,868 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-28 02:37:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:45,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:37:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:45,873 INFO L225 Difference]: With dead ends: 49 [2019-11-28 02:37:45,873 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 02:37:45,874 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 02:37:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 02:37:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-11-28 02:37:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 02:37:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 02:37:45,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-11-28 02:37:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:45,882 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 02:37:45,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-28 02:37:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:37:45,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:45,883 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:45,883 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 02:37:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:45,883 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-11-28 02:37:45,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:45,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26918204] [2019-11-28 02:37:45,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,952 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 02:37:45,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26918204] [2019-11-28 02:37:45,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:45,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:37:45,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692036258] [2019-11-28 02:37:45,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:45,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:45,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:45,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:45,955 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-11-28 02:37:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:46,111 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-28 02:37:46,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:46,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-28 02:37:46,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:46,114 INFO L225 Difference]: With dead ends: 40 [2019-11-28 02:37:46,114 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:37:46,115 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 02:37:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:37:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 02:37:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:37:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-28 02:37:46,122 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-11-28 02:37:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:46,122 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-28 02:37:46,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-28 02:37:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:37:46,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:46,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:46,124 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 02:37:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-11-28 02:37:46,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:46,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135645035] [2019-11-28 02:37:46,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,256 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 02:37:46,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135645035] [2019-11-28 02:37:46,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:46,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:37:46,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299610372] [2019-11-28 02:37:46,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:37:46,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:46,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:37:46,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:46,262 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2019-11-28 02:37:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:46,446 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-28 02:37:46,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:37:46,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 02:37:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:46,449 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:37:46,449 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:37:46,449 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 02:37:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:37:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 02:37:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 02:37:46,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-11-28 02:37:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:46,456 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 02:37:46,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:37:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 02:37:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:37:46,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:46,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:46,457 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 02:37:46,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:46,458 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 02:37:46,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:46,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437054969] [2019-11-28 02:37:46,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,540 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 02:37:46,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437054969] [2019-11-28 02:37:46,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:46,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:37:46,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551616169] [2019-11-28 02:37:46,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:46,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:46,543 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-11-28 02:37:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:46,757 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-11-28 02:37:46,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:46,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 02:37:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:46,761 INFO L225 Difference]: With dead ends: 60 [2019-11-28 02:37:46,762 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 02:37:46,762 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 02:37:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 02:37:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2019-11-28 02:37:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 02:37:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-11-28 02:37:46,778 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 15 [2019-11-28 02:37:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:46,779 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-11-28 02:37:46,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-11-28 02:37:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:37:46,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:46,782 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:46,782 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 02:37:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-11-28 02:37:46,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:46,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031409680] [2019-11-28 02:37:46,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,922 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 02:37:46,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031409680] [2019-11-28 02:37:46,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:46,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 02:37:46,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850507834] [2019-11-28 02:37:46,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:37:46,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:46,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:37:46,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:46,927 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 8 states. [2019-11-28 02:37:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:47,143 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-28 02:37:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:37:47,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 02:37:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:47,145 INFO L225 Difference]: With dead ends: 70 [2019-11-28 02:37:47,145 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 02:37:47,146 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 02:37:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 02:37:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-11-28 02:37:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:37:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 02:37:47,158 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-11-28 02:37:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:47,160 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 02:37:47,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:37:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 02:37:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:37:47,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:47,162 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 02:37:47,163 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 02:37:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:47,163 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2019-11-28 02:37:47,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:47,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335740269] [2019-11-28 02:37:47,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,264 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 02:37:47,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335740269] [2019-11-28 02:37:47,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:47,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:47,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314380581] [2019-11-28 02:37:47,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:47,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:47,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:47,268 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-11-28 02:37:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:47,343 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-11-28 02:37:47,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:47,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-28 02:37:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:47,345 INFO L225 Difference]: With dead ends: 48 [2019-11-28 02:37:47,345 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 02:37:47,346 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 02:37:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 02:37:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 02:37:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:37:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-28 02:37:47,352 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 20 [2019-11-28 02:37:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:47,352 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-28 02:37:47,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-28 02:37:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:37:47,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:47,353 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 02:37:47,354 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 02:37:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:47,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234190, now seen corresponding path program 1 times [2019-11-28 02:37:47,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:47,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061963717] [2019-11-28 02:37:47,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,461 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 02:37:47,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061963717] [2019-11-28 02:37:47,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:47,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:37:47,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875031754] [2019-11-28 02:37:47,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:37:47,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:47,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:37:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:47,464 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-11-28 02:37:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:47,554 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-11-28 02:37:47,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:47,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-28 02:37:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:47,557 INFO L225 Difference]: With dead ends: 52 [2019-11-28 02:37:47,557 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 02:37:47,558 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 02:37:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 02:37:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-11-28 02:37:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:37:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 02:37:47,564 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 20 [2019-11-28 02:37:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:47,565 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 02:37:47,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:37:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 02:37:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:37:47,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:47,567 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 02:37:47,567 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 02:37:47,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2011781567, now seen corresponding path program 1 times [2019-11-28 02:37:47,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:47,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673592758] [2019-11-28 02:37:47,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,631 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 02:37:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673592758] [2019-11-28 02:37:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181859399] [2019-11-28 02:37:47,633 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 02:37:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:37:47,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:47,735 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 02:37:47,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:47,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 02:37:47,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747291120] [2019-11-28 02:37:47,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:47,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:47,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:47,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:47,738 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2019-11-28 02:37:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:47,855 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-11-28 02:37:47,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:47,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 02:37:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:47,857 INFO L225 Difference]: With dead ends: 74 [2019-11-28 02:37:47,857 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 02:37:47,858 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 02:37:47,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 02:37:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2019-11-28 02:37:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 02:37:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-11-28 02:37:47,864 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 26 [2019-11-28 02:37:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:47,865 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-11-28 02:37:47,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-11-28 02:37:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:37:47,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:47,866 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 02:37:48,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:48,078 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 02:37:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1143280978, now seen corresponding path program 1 times [2019-11-28 02:37:48,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:48,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752795367] [2019-11-28 02:37:48,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,205 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 02:37:48,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752795367] [2019-11-28 02:37:48,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356297269] [2019-11-28 02:37:48,206 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 02:37:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:37:48,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:48,309 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 02:37:48,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:48,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-11-28 02:37:48,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227824855] [2019-11-28 02:37:48,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:48,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:48,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:37:48,311 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 6 states. [2019-11-28 02:37:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:48,444 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-11-28 02:37:48,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:48,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-28 02:37:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:48,445 INFO L225 Difference]: With dead ends: 67 [2019-11-28 02:37:48,445 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 02:37:48,446 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 02:37:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 02:37:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2019-11-28 02:37:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 02:37:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-11-28 02:37:48,452 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2019-11-28 02:37:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:48,452 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-11-28 02:37:48,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-11-28 02:37:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 02:37:48,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:48,454 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 02:37:48,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:48,659 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 02:37:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1735380924, now seen corresponding path program 1 times [2019-11-28 02:37:48,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:48,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409018191] [2019-11-28 02:37:48,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,763 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 02:37:48,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409018191] [2019-11-28 02:37:48,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226227778] [2019-11-28 02:37:48,764 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 02:37:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:48,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:37:48,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:48,848 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 02:37:48,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:48,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-11-28 02:37:48,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250642844] [2019-11-28 02:37:48,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:37:48,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:37:48,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:48,850 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 11 states. [2019-11-28 02:37:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:49,136 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-11-28 02:37:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:37:49,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-11-28 02:37:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:49,138 INFO L225 Difference]: With dead ends: 73 [2019-11-28 02:37:49,138 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 02:37:49,139 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 02:37:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 02:37:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2019-11-28 02:37:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 02:37:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-11-28 02:37:49,155 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 32 [2019-11-28 02:37:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:49,157 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-11-28 02:37:49,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:37:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2019-11-28 02:37:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 02:37:49,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:49,161 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 02:37:49,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:49,369 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 02:37:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:49,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1978883467, now seen corresponding path program 2 times [2019-11-28 02:37:49,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:49,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948541940] [2019-11-28 02:37:49,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,459 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 02:37:49,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948541940] [2019-11-28 02:37:49,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308061782] [2019-11-28 02:37:49,460 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 02:37:49,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:37:49,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:49,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:37:49,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:49,575 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 02:37:49,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:49,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-11-28 02:37:49,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647733138] [2019-11-28 02:37:49,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:37:49,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:49,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:37:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:49,584 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 11 states. [2019-11-28 02:37:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:49,935 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-11-28 02:37:49,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:37:49,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-28 02:37:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:49,937 INFO L225 Difference]: With dead ends: 71 [2019-11-28 02:37:49,937 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 02:37:49,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:37:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 02:37:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-11-28 02:37:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-28 02:37:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-11-28 02:37:49,942 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 36 [2019-11-28 02:37:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:49,943 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-11-28 02:37:49,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:37:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-11-28 02:37:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 02:37:49,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:49,945 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 02:37:50,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:50,154 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 02:37:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1930842354, now seen corresponding path program 3 times [2019-11-28 02:37:50,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:50,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823445984] [2019-11-28 02:37:50,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,259 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 02:37:50,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823445984] [2019-11-28 02:37:50,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808491283] [2019-11-28 02:37:50,259 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 02:37:50,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 02:37:50,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:50,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:37:50,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:50,335 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_24|]} [2019-11-28 02:37:50,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:50,361 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 02:37:50,361 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:50,376 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:50,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:50,384 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 02:37:50,385 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:50,393 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:50,394 INFO L508 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 02:37:50,394 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-28 02:37:50,544 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 02:37:50,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:50,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-28 02:37:50,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495929387] [2019-11-28 02:37:50,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:37:50,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:37:50,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:37:50,547 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 9 states. [2019-11-28 02:37:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:50,825 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-11-28 02:37:50,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:37:50,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-28 02:37:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:50,827 INFO L225 Difference]: With dead ends: 65 [2019-11-28 02:37:50,827 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 02:37:50,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 02:37:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-28 02:37:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 02:37:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-11-28 02:37:50,831 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2019-11-28 02:37:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:50,832 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-11-28 02:37:50,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:37:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-11-28 02:37:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 02:37:50,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:50,833 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 02:37:51,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:51,042 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 02:37:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash 492189859, now seen corresponding path program 2 times [2019-11-28 02:37:51,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:51,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013231808] [2019-11-28 02:37:51,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,097 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 02:37:51,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013231808] [2019-11-28 02:37:51,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177244875] [2019-11-28 02:37:51,098 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 02:37:51,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:51,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:51,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:51,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:51,141 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_13|], 1=[|v_#valid_25|]} [2019-11-28 02:37:51,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:51,146 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 02:37:51,146 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:51,155 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:51,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:51,158 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 02:37:51,158 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:51,163 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:51,163 INFO L508 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 02:37:51,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-28 02:37:51,351 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 02:37:51,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:51,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-28 02:37:51,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530060095] [2019-11-28 02:37:51,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:51,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:51,355 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 6 states. [2019-11-28 02:37:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:51,405 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-11-28 02:37:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:51,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-28 02:37:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:51,407 INFO L225 Difference]: With dead ends: 61 [2019-11-28 02:37:51,408 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 02:37:51,408 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 02:37:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 02:37:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-11-28 02:37:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 02:37:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-28 02:37:51,421 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 47 [2019-11-28 02:37:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:51,422 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-28 02:37:51,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-28 02:37:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 02:37:51,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:51,428 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 02:37:51,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:51,634 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 02:37:51,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:51,635 INFO L82 PathProgramCache]: Analyzing trace with hash -190258011, now seen corresponding path program 1 times [2019-11-28 02:37:51,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:51,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749946261] [2019-11-28 02:37:51,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,704 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 02:37:51,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749946261] [2019-11-28 02:37:51,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696141852] [2019-11-28 02:37:51,705 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 02:37:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:37:51,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:51,796 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 02:37:51,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:51,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 02:37:51,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533294648] [2019-11-28 02:37:51,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:37:51,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:51,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:37:51,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:51,799 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 7 states. [2019-11-28 02:37:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:51,910 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-11-28 02:37:51,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:51,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-28 02:37:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:51,912 INFO L225 Difference]: With dead ends: 85 [2019-11-28 02:37:51,913 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 02:37:51,913 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 02:37:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 02:37:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2019-11-28 02:37:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 02:37:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2019-11-28 02:37:51,918 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 50 [2019-11-28 02:37:51,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:51,918 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2019-11-28 02:37:51,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:37:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2019-11-28 02:37:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-28 02:37:51,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:51,920 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 02:37:52,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:52,125 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 02:37:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1277143159, now seen corresponding path program 2 times [2019-11-28 02:37:52,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:52,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942219272] [2019-11-28 02:37:52,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:52,230 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 02:37:52,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942219272] [2019-11-28 02:37:52,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320761590] [2019-11-28 02:37:52,231 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 02:37:52,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:52,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:52,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:52,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:52,373 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:52,374 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 02:37:52,375 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:52,383 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:52,384 INFO L508 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 02:37:52,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:52,463 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:52,463 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 02:37:52,464 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:52,471 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:52,472 INFO L508 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 02:37:52,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:52,538 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:52,539 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 02:37:52,539 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:52,545 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:52,546 INFO L508 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 02:37:52,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:52,633 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 02:37:52,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:52,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2019-11-28 02:37:52,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392650253] [2019-11-28 02:37:52,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:52,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:52,635 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2019-11-28 02:37:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:52,724 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2019-11-28 02:37:52,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:52,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-28 02:37:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:52,725 INFO L225 Difference]: With dead ends: 67 [2019-11-28 02:37:52,725 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:37:52,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:37:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:37:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:37:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:37:52,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2019-11-28 02:37:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:52,728 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:37:52,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:37:52,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:37:52,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:52,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:37:52 BoogieIcfgContainer [2019-11-28 02:37:52,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:37:52,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:37:52,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:37:52,936 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:37:52,937 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:44" (3/4) ... [2019-11-28 02:37:52,941 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:37:52,949 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:37:52,949 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 02:37:52,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:37:52,954 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-11-28 02:37:52,955 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 02:37:52,955 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:37:52,955 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:37:52,998 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:37:52,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:37:53,000 INFO L168 Benchmark]: Toolchain (without parser) took 8718.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -218.2 MB). Peak memory consumption was 62.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:53,000 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:53,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.60 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:53,001 INFO L168 Benchmark]: Boogie Preprocessor took 102.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:53,002 INFO L168 Benchmark]: RCFGBuilder took 330.95 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:53,002 INFO L168 Benchmark]: TraceAbstraction took 7983.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:53,003 INFO L168 Benchmark]: Witness Printer took 63.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:53,005 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 231.60 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 330.95 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7983.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 138.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. * Witness Printer took 63.19 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. 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: 7.8s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 2.7s, 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.6s 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.3s SatisfiabilityAnalysisTime, 2.2s 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...