./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer --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 a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 04:45:14,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 04:45:14,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 04:45:14,803 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 04:45:14,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 04:45:14,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 04:45:14,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 04:45:14,806 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 04:45:14,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 04:45:14,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 04:45:14,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 04:45:14,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 04:45:14,812 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 04:45:14,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 04:45:14,814 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 04:45:14,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 04:45:14,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 04:45:14,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 04:45:14,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 04:45:14,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 04:45:14,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 04:45:14,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 04:45:14,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 04:45:14,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 04:45:14,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 04:45:14,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 04:45:14,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 04:45:14,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 04:45:14,825 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 04:45:14,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 04:45:14,826 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 04:45:14,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 04:45:14,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 04:45:14,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 04:45:14,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 04:45:14,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 04:45:14,830 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-27 04:45:14,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 04:45:14,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 04:45:14,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 04:45:14,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 04:45:14,843 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 04:45:14,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 04:45:14,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 04:45:14,844 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 04:45:14,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 04:45:14,844 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 04:45:14,844 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 04:45:14,844 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-27 04:45:14,844 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-27 04:45:14,844 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-27 04:45:14,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 04:45:14,845 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 04:45:14,845 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 04:45:14,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 04:45:14,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 04:45:14,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 04:45:14,846 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 04:45:14,846 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 04:45:14,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 04:45:14,846 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 04:45:14,846 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 04:45:14,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer 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 -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2018-10-27 04:45:14,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 04:45:14,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 04:45:14,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 04:45:14,897 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 04:45:14,898 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 04:45:14,898 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-10-27 04:45:14,948 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/data/26571e703/0a74e3049a83447c9f90af56722c135f/FLAGbbe3da84a [2018-10-27 04:45:15,323 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 04:45:15,324 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-10-27 04:45:15,329 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/data/26571e703/0a74e3049a83447c9f90af56722c135f/FLAGbbe3da84a [2018-10-27 04:45:15,341 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/data/26571e703/0a74e3049a83447c9f90af56722c135f [2018-10-27 04:45:15,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 04:45:15,345 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 04:45:15,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:15,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 04:45:15,350 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 04:45:15,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4087c74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15, skipping insertion in model container [2018-10-27 04:45:15,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 04:45:15,378 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 04:45:15,509 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:15,518 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 04:45:15,533 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 04:45:15,546 INFO L193 MainTranslator]: Completed translation [2018-10-27 04:45:15,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15 WrapperNode [2018-10-27 04:45:15,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 04:45:15,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 04:45:15,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 04:45:15,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 04:45:15,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (1/1) ... [2018-10-27 04:45:15,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 04:45:15,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 04:45:15,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 04:45:15,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 04:45:15,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/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 [2018-10-27 04:45:15,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 04:45:15,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 04:45:15,701 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-10-27 04:45:15,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 04:45:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-10-27 04:45:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 04:45:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 04:45:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-27 04:45:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 04:45:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-27 04:45:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 04:45:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 04:45:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-27 04:45:16,241 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 04:45:16,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:16 BoogieIcfgContainer [2018-10-27 04:45:16,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 04:45:16,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 04:45:16,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 04:45:16,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 04:45:16,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 04:45:15" (1/3) ... [2018-10-27 04:45:16,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d3cbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:16, skipping insertion in model container [2018-10-27 04:45:16,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 04:45:15" (2/3) ... [2018-10-27 04:45:16,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d3cbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 04:45:16, skipping insertion in model container [2018-10-27 04:45:16,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:16" (3/3) ... [2018-10-27 04:45:16,249 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-10-27 04:45:16,257 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 04:45:16,264 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-27 04:45:16,277 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-27 04:45:16,299 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 04:45:16,299 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 04:45:16,299 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-27 04:45:16,300 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 04:45:16,300 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 04:45:16,300 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 04:45:16,300 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 04:45:16,300 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 04:45:16,300 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 04:45:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-10-27 04:45:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-27 04:45:16,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:16,321 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:16,323 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:16,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:16,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-10-27 04:45:16,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:16,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:16,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:16,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:16,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:16,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:16,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:45:16,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 04:45:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 04:45:16,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:45:16,450 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-10-27 04:45:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:16,472 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-10-27 04:45:16,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 04:45:16,473 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-27 04:45:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:16,481 INFO L225 Difference]: With dead ends: 49 [2018-10-27 04:45:16,481 INFO L226 Difference]: Without dead ends: 46 [2018-10-27 04:45:16,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 04:45:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-27 04:45:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-27 04:45:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 04:45:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-10-27 04:45:16,513 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-10-27 04:45:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:16,513 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-10-27 04:45:16,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 04:45:16,514 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-10-27 04:45:16,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 04:45:16,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:16,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:16,515 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:16,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-10-27 04:45:16,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:16,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:16,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:16,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:16,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:16,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:16,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:16,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:45:16,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:45:16,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:45:16,562 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-10-27 04:45:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:16,675 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-10-27 04:45:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:45:16,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-27 04:45:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:16,681 INFO L225 Difference]: With dead ends: 67 [2018-10-27 04:45:16,681 INFO L226 Difference]: Without dead ends: 67 [2018-10-27 04:45:16,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:45:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-27 04:45:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-10-27 04:45:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-27 04:45:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-10-27 04:45:16,692 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-10-27 04:45:16,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:16,692 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-10-27 04:45:16,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:45:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-10-27 04:45:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 04:45:16,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:16,693 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:16,693 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:16,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:16,694 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-10-27 04:45:16,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:16,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:16,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:16,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:16,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:16,807 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-10-27 04:45:17,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:17,144 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-10-27 04:45:17,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:17,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-27 04:45:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:17,148 INFO L225 Difference]: With dead ends: 73 [2018-10-27 04:45:17,148 INFO L226 Difference]: Without dead ends: 73 [2018-10-27 04:45:17,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-27 04:45:17,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-10-27 04:45:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-27 04:45:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-10-27 04:45:17,155 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-10-27 04:45:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:17,155 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-10-27 04:45:17,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-10-27 04:45:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 04:45:17,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:17,156 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:17,157 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:17,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-10-27 04:45:17,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:17,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:17,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:17,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:17,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:17,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:17,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 04:45:17,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 04:45:17,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 04:45:17,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:45:17,193 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-10-27 04:45:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:17,243 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-10-27 04:45:17,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 04:45:17,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-27 04:45:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:17,245 INFO L225 Difference]: With dead ends: 55 [2018-10-27 04:45:17,245 INFO L226 Difference]: Without dead ends: 55 [2018-10-27 04:45:17,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 04:45:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-27 04:45:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-27 04:45:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 04:45:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-10-27 04:45:17,249 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-10-27 04:45:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:17,250 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-10-27 04:45:17,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 04:45:17,250 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-10-27 04:45:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 04:45:17,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:17,250 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:17,251 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:17,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:17,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-10-27 04:45:17,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:17,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:17,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:17,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:17,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:17,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:17,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 04:45:17,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 04:45:17,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 04:45:17,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:17,397 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-10-27 04:45:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:17,478 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-10-27 04:45:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:17,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-10-27 04:45:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:17,479 INFO L225 Difference]: With dead ends: 65 [2018-10-27 04:45:17,479 INFO L226 Difference]: Without dead ends: 65 [2018-10-27 04:45:17,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 04:45:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-27 04:45:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-10-27 04:45:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-27 04:45:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-10-27 04:45:17,484 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-10-27 04:45:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:17,484 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-10-27 04:45:17,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 04:45:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-10-27 04:45:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 04:45:17,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:17,485 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:17,485 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:17,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-10-27 04:45:17,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:17,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:17,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:17,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:45:17,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:17,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:17,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:17,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:17,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:17,842 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-10-27 04:45:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:17,908 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-10-27 04:45:17,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:17,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-10-27 04:45:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:17,909 INFO L225 Difference]: With dead ends: 69 [2018-10-27 04:45:17,909 INFO L226 Difference]: Without dead ends: 69 [2018-10-27 04:45:17,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-27 04:45:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-10-27 04:45:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 04:45:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-10-27 04:45:17,914 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-10-27 04:45:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:17,914 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-10-27 04:45:17,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-10-27 04:45:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 04:45:17,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:17,915 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:17,915 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:17,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-10-27 04:45:17,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:17,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:17,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:18,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:18,090 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:18,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:18,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-27 04:45:18,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:18,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 04:45:18,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-27 04:45:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 04:45:18,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:18,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-10-27 04:45:18,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:45:18,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:45:18,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:18,539 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 11 states. [2018-10-27 04:45:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:19,095 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-10-27 04:45:19,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 04:45:19,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-10-27 04:45:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:19,096 INFO L225 Difference]: With dead ends: 74 [2018-10-27 04:45:19,097 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 04:45:19,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:45:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 04:45:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2018-10-27 04:45:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 04:45:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-10-27 04:45:19,102 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2018-10-27 04:45:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:19,102 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-10-27 04:45:19,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:45:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-10-27 04:45:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 04:45:19,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:19,105 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:19,105 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:19,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:19,105 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-10-27 04:45:19,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:19,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:19,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:19,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:19,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:19,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:19,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 04:45:19,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:19,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:19,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:19,150 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 5 states. [2018-10-27 04:45:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:19,205 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-10-27 04:45:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 04:45:19,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-10-27 04:45:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:19,207 INFO L225 Difference]: With dead ends: 59 [2018-10-27 04:45:19,207 INFO L226 Difference]: Without dead ends: 59 [2018-10-27 04:45:19,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-27 04:45:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-27 04:45:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-27 04:45:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-10-27 04:45:19,213 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29 [2018-10-27 04:45:19,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:19,213 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-10-27 04:45:19,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-10-27 04:45:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:45:19,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:19,217 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:19,217 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:19,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-10-27 04:45:19,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:19,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:19,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:19,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:19,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:45:19,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 04:45:19,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 04:45:19,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 04:45:19,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 04:45:19,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:19,393 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-10-27 04:45:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:19,449 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-10-27 04:45:19,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:19,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-10-27 04:45:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:19,450 INFO L225 Difference]: With dead ends: 64 [2018-10-27 04:45:19,450 INFO L226 Difference]: Without dead ends: 64 [2018-10-27 04:45:19,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 04:45:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-27 04:45:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-10-27 04:45:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-27 04:45:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-10-27 04:45:19,453 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 32 [2018-10-27 04:45:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:19,454 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-10-27 04:45:19,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 04:45:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-10-27 04:45:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 04:45:19,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:19,458 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:19,458 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:19,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-10-27 04:45:19,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:19,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:19,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:19,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:19,491 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 04:45:19,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:19,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:19,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:19,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 04:45:19,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 04:45:19,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 04:45:19,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:19,552 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-10-27 04:45:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:19,707 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-10-27 04:45:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 04:45:19,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-10-27 04:45:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:19,708 INFO L225 Difference]: With dead ends: 83 [2018-10-27 04:45:19,708 INFO L226 Difference]: Without dead ends: 83 [2018-10-27 04:45:19,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 04:45:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-27 04:45:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-10-27 04:45:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-27 04:45:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-10-27 04:45:19,713 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-10-27 04:45:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:19,713 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-10-27 04:45:19,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 04:45:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-10-27 04:45:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-27 04:45:19,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:19,714 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:19,714 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:19,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-10-27 04:45:19,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:19,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:19,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:19,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:19,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:19,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:19,918 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:19,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 04:45:20,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:20,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-10-27 04:45:20,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 04:45:20,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 04:45:20,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-10-27 04:45:20,034 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 11 states. [2018-10-27 04:45:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:20,154 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-10-27 04:45:20,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 04:45:20,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-10-27 04:45:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:20,155 INFO L225 Difference]: With dead ends: 98 [2018-10-27 04:45:20,155 INFO L226 Difference]: Without dead ends: 98 [2018-10-27 04:45:20,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:45:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-27 04:45:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2018-10-27 04:45:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 04:45:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-10-27 04:45:20,160 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 34 [2018-10-27 04:45:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:20,160 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-10-27 04:45:20,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 04:45:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-10-27 04:45:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 04:45:20,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:20,161 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:20,161 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:20,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-10-27 04:45:20,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:20,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:20,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 04:45:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 04:45:20,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:20,327 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:20,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:20,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-27 04:45:20,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:20,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:20,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:20,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-10-27 04:45:20,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:20,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:20,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-10-27 04:45:20,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 04:45:20,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-10-27 04:45:20,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 04:45:20,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 04:45:20,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-10-27 04:45:20,653 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (store |c_old(#valid)| |main_~#b~0.base| 0) |c_#valid|))) is different from true [2018-10-27 04:45:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 04:45:20,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:20,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-10-27 04:45:20,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 04:45:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 04:45:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2018-10-27 04:45:20,675 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 9 states. [2018-10-27 04:45:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:21,013 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-10-27 04:45:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:45:21,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-10-27 04:45:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:21,015 INFO L225 Difference]: With dead ends: 109 [2018-10-27 04:45:21,015 INFO L226 Difference]: Without dead ends: 68 [2018-10-27 04:45:21,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=175, Unknown=1, NotChecked=28, Total=272 [2018-10-27 04:45:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-27 04:45:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-10-27 04:45:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-27 04:45:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-10-27 04:45:21,018 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 45 [2018-10-27 04:45:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:21,018 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-10-27 04:45:21,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 04:45:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-10-27 04:45:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-27 04:45:21,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:21,020 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:21,021 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:21,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:21,021 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-10-27 04:45:21,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:21,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:21,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:21,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:45:21,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:21,155 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:21,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 04:45:21,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 04:45:21,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:21,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 04:45:21,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 04:45:21,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2018-10-27 04:45:21,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 04:45:21,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 04:45:21,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-27 04:45:21,234 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 14 states. [2018-10-27 04:45:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:21,568 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-10-27 04:45:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 04:45:21,569 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-10-27 04:45:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:21,569 INFO L225 Difference]: With dead ends: 70 [2018-10-27 04:45:21,569 INFO L226 Difference]: Without dead ends: 64 [2018-10-27 04:45:21,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-10-27 04:45:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-27 04:45:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-10-27 04:45:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-27 04:45:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-10-27 04:45:21,572 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 47 [2018-10-27 04:45:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:21,572 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-10-27 04:45:21,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 04:45:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-10-27 04:45:21,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-27 04:45:21,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 04:45:21,573 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 04:45:21,573 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2018-10-27 04:45:21,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 04:45:21,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times [2018-10-27 04:45:21,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 04:45:21,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 04:45:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 04:45:21,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 04:45:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 04:45:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 04:45:21,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 04:45:21,644 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 04:45:21,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 04:45:21,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 04:45:21,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 04:45:21,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 04:45:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-27 04:45:21,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 04:45:21,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-10-27 04:45:21,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 04:45:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 04:45:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 04:45:21,691 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 7 states. [2018-10-27 04:45:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 04:45:21,799 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-10-27 04:45:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 04:45:21,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-10-27 04:45:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 04:45:21,800 INFO L225 Difference]: With dead ends: 59 [2018-10-27 04:45:21,800 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 04:45:21,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-27 04:45:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 04:45:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 04:45:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 04:45:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 04:45:21,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-10-27 04:45:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 04:45:21,801 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 04:45:21,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 04:45:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 04:45:21,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 04:45:21,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 04:45:21 BoogieIcfgContainer [2018-10-27 04:45:21,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 04:45:21,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 04:45:21,805 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 04:45:21,806 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 04:45:21,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 04:45:16" (3/4) ... [2018-10-27 04:45:21,811 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 04:45:21,815 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 04:45:21,815 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-10-27 04:45:21,816 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 04:45:21,819 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-10-27 04:45:21,819 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-10-27 04:45:21,820 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 04:45:21,820 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 04:45:21,853 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cb3f5d1a-a32e-4e65-a404-4e7bb9bd19ca/bin-2019/uautomizer/witness.graphml [2018-10-27 04:45:21,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 04:45:21,854 INFO L168 Benchmark]: Toolchain (without parser) took 6510.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 960.7 MB in the beginning and 1.1 GB in the end (delta: -130.5 MB). Peak memory consumption was 95.0 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:21,855 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 04:45:21,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.50 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:21,856 INFO L168 Benchmark]: Boogie Preprocessor took 32.18 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:21,856 INFO L168 Benchmark]: RCFGBuilder took 661.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:21,857 INFO L168 Benchmark]: TraceAbstraction took 5563.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:21,857 INFO L168 Benchmark]: Witness Printer took 48.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 04:45:21,862 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.50 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.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 32.18 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 661.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5563.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. * Witness Printer took 48.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: 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, 49 locations, 8 error locations. SAFE Result, 5.5s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 471 SDtfs, 645 SDslu, 958 SDs, 0 SdLazy, 899 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 244 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 128 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 649 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 629 ConstructedInterpolants, 20 QuantifiedInterpolants, 72655 SizeOfPredicates, 13 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 217/249 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...