./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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-635dfa2 [2018-12-09 00:11:37,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:11:37,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:11:37,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:11:37,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:11:37,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:11:37,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:11:37,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:11:37,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:11:37,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:11:37,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:11:37,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:11:37,740 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:11:37,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:11:37,741 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:11:37,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:11:37,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:11:37,743 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:11:37,744 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:11:37,745 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:11:37,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:11:37,746 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:11:37,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:11:37,748 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:11:37,748 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:11:37,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:11:37,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:11:37,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:11:37,750 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:11:37,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:11:37,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:11:37,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:11:37,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:11:37,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:11:37,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:11:37,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:11:37,752 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-09 00:11:37,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:11:37,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:11:37,760 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:11:37,760 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:11:37,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:11:37,761 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:11:37,761 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:11:37,761 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:11:37,761 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:11:37,761 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:11:37,762 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:11:37,763 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:11:37,763 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:11:37,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:11:37,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:11:37,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:11:37,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:11:37,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:11:37,763 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:11:37,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:11:37,764 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_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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-12-09 00:11:37,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:11:37,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:11:37,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:11:37,794 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:11:37,794 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:11:37,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-12-09 00:11:37,827 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/data/b2128bddb/a520e7aeae744a20b88a60c524bda407/FLAGa66f57ded [2018-12-09 00:11:38,227 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:11:38,227 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-12-09 00:11:38,231 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/data/b2128bddb/a520e7aeae744a20b88a60c524bda407/FLAGa66f57ded [2018-12-09 00:11:38,238 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/data/b2128bddb/a520e7aeae744a20b88a60c524bda407 [2018-12-09 00:11:38,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:11:38,241 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-09 00:11:38,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:11:38,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:11:38,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:11:38,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5663953f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38, skipping insertion in model container [2018-12-09 00:11:38,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:11:38,263 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:11:38,349 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:11:38,355 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:11:38,365 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:11:38,373 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:11:38,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38 WrapperNode [2018-12-09 00:11:38,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:11:38,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:11:38,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:11:38,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:11:38,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (1/1) ... [2018-12-09 00:11:38,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:11:38,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:11:38,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:11:38,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:11:38,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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-12-09 00:11:38,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:11:38,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:11:38,455 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-12-09 00:11:38,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:11:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-12-09 00:11:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:11:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:11:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:11:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:11:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:11:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:11:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:11:38,584 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:11:38,584 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 00:11:38,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:11:38 BoogieIcfgContainer [2018-12-09 00:11:38,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:11:38,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:11:38,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:11:38,587 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:11:38,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:11:38" (1/3) ... [2018-12-09 00:11:38,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20807b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:11:38, skipping insertion in model container [2018-12-09 00:11:38,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:11:38" (2/3) ... [2018-12-09 00:11:38,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b20807b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:11:38, skipping insertion in model container [2018-12-09 00:11:38,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:11:38" (3/3) ... [2018-12-09 00:11:38,590 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-12-09 00:11:38,595 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:11:38,600 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-12-09 00:11:38,610 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-12-09 00:11:38,625 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:11:38,626 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:11:38,626 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 00:11:38,626 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:11:38,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:11:38,626 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:11:38,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:11:38,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:11:38,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:11:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-09 00:11:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 00:11:38,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:38,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:38,643 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:38,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:38,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-12-09 00:11:38,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:38,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:38,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:38,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:38,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:11:38,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:11:38,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:11:38,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:11:38,751 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-09 00:11:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:38,797 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-12-09 00:11:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:11:38,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 00:11:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:38,806 INFO L225 Difference]: With dead ends: 58 [2018-12-09 00:11:38,806 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 00:11:38,808 INFO L631 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-12-09 00:11:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 00:11:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-12-09 00:11:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 00:11:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-09 00:11:38,833 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-12-09 00:11:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:38,833 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-09 00:11:38,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:11:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-09 00:11:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 00:11:38,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:38,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:38,834 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:38,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:38,834 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-12-09 00:11:38,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:38,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:38,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:11:38,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:11:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:11:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:11:38,892 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-12-09 00:11:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:38,960 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-12-09 00:11:38,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:11:38,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-09 00:11:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:38,962 INFO L225 Difference]: With dead ends: 59 [2018-12-09 00:11:38,962 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 00:11:38,963 INFO L631 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-12-09 00:11:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 00:11:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-12-09 00:11:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 00:11:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-12-09 00:11:38,967 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-12-09 00:11:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:38,968 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-12-09 00:11:38,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:11:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-12-09 00:11:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:11:38,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:38,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:38,969 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:38,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-12-09 00:11:38,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:38,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:38,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:38,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:38,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:38,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:11:38,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:11:38,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:11:38,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:11:38,996 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-12-09 00:11:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:39,017 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-09 00:11:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:11:39,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 00:11:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:39,018 INFO L225 Difference]: With dead ends: 43 [2018-12-09 00:11:39,019 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 00:11:39,019 INFO L631 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-12-09 00:11:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 00:11:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 00:11:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 00:11:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-09 00:11:39,021 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2018-12-09 00:11:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:39,022 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-09 00:11:39,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:11:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-09 00:11:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 00:11:39,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:39,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:39,022 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:39,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2018-12-09 00:11:39,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:39,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:39,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:39,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 00:11:39,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:11:39,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:11:39,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:11:39,049 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2018-12-09 00:11:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:39,067 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-12-09 00:11:39,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:11:39,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 00:11:39,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:39,068 INFO L225 Difference]: With dead ends: 47 [2018-12-09 00:11:39,068 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 00:11:39,068 INFO L631 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-12-09 00:11:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 00:11:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-09 00:11:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 00:11:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-12-09 00:11:39,070 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-12-09 00:11:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:39,070 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-12-09 00:11:39,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:11:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-12-09 00:11:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 00:11:39,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:39,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:39,071 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:39,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2018-12-09 00:11:39,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:39,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:39,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:39,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:39,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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-12-09 00:11:39,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:39,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:11:39,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-09 00:11:39,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:11:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:11:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:11:39,166 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2018-12-09 00:11:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:39,199 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-09 00:11:39,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:11:39,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 00:11:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:39,201 INFO L225 Difference]: With dead ends: 69 [2018-12-09 00:11:39,201 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 00:11:39,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-12-09 00:11:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 00:11:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-12-09 00:11:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 00:11:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-12-09 00:11:39,205 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2018-12-09 00:11:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:39,206 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-12-09 00:11:39,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:11:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-12-09 00:11:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 00:11:39,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:39,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:39,207 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:39,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2018-12-09 00:11:39,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:11:39,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:39,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:11:39,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:11:39,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:11:39,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:11:39,257 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-12-09 00:11:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:39,292 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-12-09 00:11:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:11:39,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-09 00:11:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:39,293 INFO L225 Difference]: With dead ends: 62 [2018-12-09 00:11:39,293 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 00:11:39,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:11:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 00:11:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-12-09 00:11:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 00:11:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-12-09 00:11:39,296 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-12-09 00:11:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:39,296 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-12-09 00:11:39,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:11:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-12-09 00:11:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:11:39,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:39,296 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:39,296 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:39,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2018-12-09 00:11:39,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:39,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:39,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:39,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:11:39,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:11:39,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:11:39,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:11:39,319 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2018-12-09 00:11:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:39,344 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-12-09 00:11:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:11:39,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 00:11:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:39,345 INFO L225 Difference]: With dead ends: 53 [2018-12-09 00:11:39,345 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 00:11:39,346 INFO L631 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-12-09 00:11:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 00:11:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-09 00:11:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 00:11:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-12-09 00:11:39,348 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2018-12-09 00:11:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:39,348 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-12-09 00:11:39,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:11:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-12-09 00:11:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 00:11:39,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:39,349 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:39,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:39,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2018-12-09 00:11:39,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:39,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:39,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:39,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:11:39,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:39,476 INFO L478 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-12-09 00:11:39,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:11:39,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:11:39,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 00:11:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 00:11:39,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:11:39,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-12-09 00:11:39,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:11:39,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:11:39,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:11:39,531 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 12 states. [2018-12-09 00:11:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:39,686 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-12-09 00:11:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:11:39,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-09 00:11:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:39,687 INFO L225 Difference]: With dead ends: 64 [2018-12-09 00:11:39,687 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 00:11:39,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:11:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 00:11:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2018-12-09 00:11:39,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 00:11:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-12-09 00:11:39,690 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2018-12-09 00:11:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:39,690 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-12-09 00:11:39,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:11:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-12-09 00:11:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:11:39,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:39,691 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:39,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:39,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2018-12-09 00:11:39,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:39,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 00:11:39,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:11:39,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:11:39,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:11:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:11:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:11:39,762 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2018-12-09 00:11:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:39,800 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-12-09 00:11:39,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:11:39,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-09 00:11:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:39,801 INFO L225 Difference]: With dead ends: 52 [2018-12-09 00:11:39,801 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 00:11:39,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:11:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 00:11:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-12-09 00:11:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 00:11:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-12-09 00:11:39,805 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2018-12-09 00:11:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:39,805 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-12-09 00:11:39,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:11:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-12-09 00:11:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:11:39,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:39,806 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:39,806 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:39,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2018-12-09 00:11:39,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:39,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:39,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:39,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:39,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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-12-09 00:11:39,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:39,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:11:39,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:11:39,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-12-09 00:11:39,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:11:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:11:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:11:39,915 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 11 states. [2018-12-09 00:11:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:39,997 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-12-09 00:11:39,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:11:39,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-12-09 00:11:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:39,998 INFO L225 Difference]: With dead ends: 78 [2018-12-09 00:11:39,998 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 00:11:39,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:11:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 00:11:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2018-12-09 00:11:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 00:11:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-12-09 00:11:40,001 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2018-12-09 00:11:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:40,001 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-12-09 00:11:40,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:11:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-12-09 00:11:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:11:40,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:40,001 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:40,002 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:40,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:40,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1979886526, now seen corresponding path program 2 times [2018-12-09 00:11:40,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:40,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:40,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:40,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 00:11:40,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:40,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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-12-09 00:11:40,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:11:40,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 00:11:40,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:11:40,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:40,039 INFO L478 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-12-09 00:11:40,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:11:40,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:11:40,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 00:11:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 00:11:40,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:11:40,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-12-09 00:11:40,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:11:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:11:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:11:40,106 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 9 states. [2018-12-09 00:11:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:40,226 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-12-09 00:11:40,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:11:40,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-09 00:11:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:40,227 INFO L225 Difference]: With dead ends: 89 [2018-12-09 00:11:40,227 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 00:11:40,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:11:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 00:11:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-12-09 00:11:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 00:11:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-12-09 00:11:40,230 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 32 [2018-12-09 00:11:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:40,230 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-12-09 00:11:40,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:11:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-12-09 00:11:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 00:11:40,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:40,231 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:40,231 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:40,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2014379143, now seen corresponding path program 2 times [2018-12-09 00:11:40,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:11:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:11:40,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:40,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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-12-09 00:11:40,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:11:40,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:11:40,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:11:40,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:11:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:11:40,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2018-12-09 00:11:40,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 00:11:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 00:11:40,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:11:40,378 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 14 states. [2018-12-09 00:11:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:40,538 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-09 00:11:40,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:11:40,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-12-09 00:11:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:40,539 INFO L225 Difference]: With dead ends: 95 [2018-12-09 00:11:40,539 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 00:11:40,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 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-12-09 00:11:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 00:11:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-12-09 00:11:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 00:11:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-12-09 00:11:40,542 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 38 [2018-12-09 00:11:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:40,543 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-12-09 00:11:40,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 00:11:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-12-09 00:11:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 00:11:40,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:40,543 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:40,544 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:40,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:40,544 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 3 times [2018-12-09 00:11:40,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:40,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:11:40,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 00:11:40,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:40,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/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-12-09 00:11:40,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:11:40,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 00:11:40,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:11:40,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 00:11:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:11:40,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-12-09 00:11:40,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:11:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:11:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:11:40,617 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2018-12-09 00:11:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:40,666 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-12-09 00:11:40,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:11:40,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-09 00:11:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:40,668 INFO L225 Difference]: With dead ends: 82 [2018-12-09 00:11:40,668 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 00:11:40,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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-12-09 00:11:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 00:11:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-09 00:11:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 00:11:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-12-09 00:11:40,671 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 43 [2018-12-09 00:11:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:40,671 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-12-09 00:11:40,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:11:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-12-09 00:11:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 00:11:40,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:40,672 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:40,672 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:40,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2125667663, now seen corresponding path program 1 times [2018-12-09 00:11:40,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:40,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:40,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:11:40,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 00:11:40,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:40,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:11:40,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:40,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:11:40,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:11:40,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-12-09 00:11:40,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 00:11:40,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 00:11:40,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:11:40,803 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 13 states. [2018-12-09 00:11:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:40,966 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-12-09 00:11:40,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:11:40,966 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-09 00:11:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:40,966 INFO L225 Difference]: With dead ends: 123 [2018-12-09 00:11:40,967 INFO L226 Difference]: Without dead ends: 120 [2018-12-09 00:11:40,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-12-09 00:11:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-09 00:11:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2018-12-09 00:11:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 00:11:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-12-09 00:11:40,969 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 72 [2018-12-09 00:11:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:40,969 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-12-09 00:11:40,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 00:11:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-12-09 00:11:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 00:11:40,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:11:40,970 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:11:40,970 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-12-09 00:11:40,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:11:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash 241209475, now seen corresponding path program 2 times [2018-12-09 00:11:40,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:11:40,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:11:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:11:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:11:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:11:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 00:11:41,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:11:41,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:11:41,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:11:41,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 00:11:41,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:11:41,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:11:41,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:11:41,058 INFO L478 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-12-09 00:11:41,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:11:41,059 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-12-09 00:11:41,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-09 00:11:41,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:11:41,078 INFO L478 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-12-09 00:11:41,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:11:41,079 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-12-09 00:11:41,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-09 00:11:41,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:11:41,097 INFO L478 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-12-09 00:11:41,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:11:41,099 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-12-09 00:11:41,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-09 00:11:41,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:11:41,118 INFO L478 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-12-09 00:11:41,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:11:41,120 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-12-09 00:11:41,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-09 00:11:41,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:11:41,141 INFO L478 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-12-09 00:11:41,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:11:41,142 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-12-09 00:11:41,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-09 00:11:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-12-09 00:11:41,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:11:41,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-12-09 00:11:41,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:11:41,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:11:41,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2018-12-09 00:11:41,473 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 12 states. [2018-12-09 00:11:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:11:41,685 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-12-09 00:11:41,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:11:41,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-12-09 00:11:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:11:41,686 INFO L225 Difference]: With dead ends: 122 [2018-12-09 00:11:41,686 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:11:41,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2018-12-09 00:11:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:11:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:11:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:11:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:11:41,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-12-09 00:11:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:11:41,688 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:11:41,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:11:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:11:41,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:11:41,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:11:41 BoogieIcfgContainer [2018-12-09 00:11:41,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:11:41,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:11:41,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:11:41,692 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:11:41,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:11:38" (3/4) ... [2018-12-09 00:11:41,695 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:11:41,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:11:41,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-12-09 00:11:41,700 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:11:41,703 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-09 00:11:41,703 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-09 00:11:41,703 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:11:41,703 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:11:41,729 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0f65ed76-944d-4f61-851c-25d7e54ddeb5/bin-2019/uautomizer/witness.graphml [2018-12-09 00:11:41,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:11:41,730 INFO L168 Benchmark]: Toolchain (without parser) took 3489.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 960.3 MB in the beginning and 827.6 MB in the end (delta: 132.7 MB). Peak memory consumption was 337.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:41,731 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:11:41,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:41,732 INFO L168 Benchmark]: Boogie Preprocessor took 48.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:41,732 INFO L168 Benchmark]: RCFGBuilder took 162.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:41,732 INFO L168 Benchmark]: TraceAbstraction took 3106.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 835.4 MB in the end (delta: 266.2 MB). Peak memory consumption was 342.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:41,733 INFO L168 Benchmark]: Witness Printer took 37.84 ms. Allocated memory is still 1.2 GB. Free memory was 835.4 MB in the beginning and 827.6 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:11:41,734 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 131.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 162.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3106.49 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.5 MB). Free memory was 1.1 GB in the beginning and 835.4 MB in the end (delta: 266.2 MB). Peak memory consumption was 342.8 MB. Max. memory is 11.5 GB. * Witness Printer took 37.84 ms. Allocated memory is still 1.2 GB. Free memory was 835.4 MB in the beginning and 827.6 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 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 - 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: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. SAFE Result, 3.0s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 383 SDtfs, 897 SDslu, 1024 SDs, 0 SdLazy, 1413 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 346 SyntacticMatches, 15 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=14, 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, 15 MinimizatonAttempts, 134 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 840 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 817 ConstructedInterpolants, 76 QuantifiedInterpolants, 158485 SizeOfPredicates, 15 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 754/881 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...