./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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 32d9f155778c5c4efaa55d37fdad329bb0d271b5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:54:19,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:54:19,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:54:19,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:54:19,361 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:54:19,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:54:19,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:54:19,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:54:19,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:54:19,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:54:19,365 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:54:19,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:54:19,366 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:54:19,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:54:19,367 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:54:19,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:54:19,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:54:19,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:54:19,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:54:19,371 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:54:19,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:54:19,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:54:19,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:54:19,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:54:19,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:54:19,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:54:19,374 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:54:19,375 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:54:19,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:54:19,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:54:19,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:54:19,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:54:19,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:54:19,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:54:19,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:54:19,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:54:19,379 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-10 01:54:19,385 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:54:19,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:54:19,386 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:54:19,386 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:54:19,387 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:54:19,387 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:54:19,387 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:54:19,387 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:54:19,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:54:19,387 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:54:19,387 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:54:19,388 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:54:19,388 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:54:19,388 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:54:19,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:54:19,389 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_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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 -> 32d9f155778c5c4efaa55d37fdad329bb0d271b5 [2018-11-10 01:54:19,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:54:19,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:54:19,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:54:19,421 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:54:19,422 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:54:19,422 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-11-10 01:54:19,458 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/data/f09638ff2/4edeef319638425e8e902ec453ce576d/FLAG15172965d [2018-11-10 01:54:19,871 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:54:19,872 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-11-10 01:54:19,876 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/data/f09638ff2/4edeef319638425e8e902ec453ce576d/FLAG15172965d [2018-11-10 01:54:19,886 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/data/f09638ff2/4edeef319638425e8e902ec453ce576d [2018-11-10 01:54:19,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:54:19,890 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 01:54:19,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:54:19,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:54:19,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:54:19,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:54:19" (1/1) ... [2018-11-10 01:54:19,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:19, skipping insertion in model container [2018-11-10 01:54:19,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:54:19" (1/1) ... [2018-11-10 01:54:19,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:54:19,921 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:54:20,018 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:54:20,023 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:54:20,034 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:54:20,043 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:54:20,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20 WrapperNode [2018-11-10 01:54:20,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:54:20,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:54:20,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:54:20,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:54:20,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:54:20,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:54:20,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:54:20,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:54:20,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:54:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:54:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-10 01:54:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:54:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-10 01:54:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 01:54:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:54:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 01:54:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 01:54:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 01:54:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:54:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:54:20,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 01:54:20,327 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:54:20,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:54:20 BoogieIcfgContainer [2018-11-10 01:54:20,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:54:20,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:54:20,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:54:20,331 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:54:20,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:54:19" (1/3) ... [2018-11-10 01:54:20,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8c5f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:54:20, skipping insertion in model container [2018-11-10 01:54:20,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (2/3) ... [2018-11-10 01:54:20,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8c5f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:54:20, skipping insertion in model container [2018-11-10 01:54:20,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:54:20" (3/3) ... [2018-11-10 01:54:20,334 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-11-10 01:54:20,341 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:54:20,346 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 01:54:20,355 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 01:54:20,374 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:54:20,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:54:20,375 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 01:54:20,375 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:54:20,375 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:54:20,375 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:54:20,375 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:54:20,376 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:54:20,376 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:54:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-10 01:54:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 01:54:20,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:20,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:20,397 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:20,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash 171629076, now seen corresponding path program 1 times [2018-11-10 01:54:20,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:20,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:20,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:20,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:54:20,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:20,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:54:20,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 01:54:20,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 01:54:20,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:54:20,500 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-10 01:54:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:20,513 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-10 01:54:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 01:54:20,513 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-10 01:54:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:20,519 INFO L225 Difference]: With dead ends: 55 [2018-11-10 01:54:20,519 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 01:54:20,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 01:54:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 01:54:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-10 01:54:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 01:54:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-10 01:54:20,543 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 15 [2018-11-10 01:54:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:20,543 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-10 01:54:20,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 01:54:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-10 01:54:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 01:54:20,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:20,544 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:20,544 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:20,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash 583043534, now seen corresponding path program 1 times [2018-11-10 01:54:20,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:20,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:20,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:20,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:54:20,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:20,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:54:20,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:54:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:54:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:20,590 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 3 states. [2018-11-10 01:54:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:20,645 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-10 01:54:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:54:20,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-10 01:54:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:20,648 INFO L225 Difference]: With dead ends: 75 [2018-11-10 01:54:20,648 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 01:54:20,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 01:54:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2018-11-10 01:54:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 01:54:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-10 01:54:20,657 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-11-10 01:54:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:20,658 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 01:54:20,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:54:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-10 01:54:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 01:54:20,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:20,659 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:20,659 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:20,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:20,659 INFO L82 PathProgramCache]: Analyzing trace with hash 986062039, now seen corresponding path program 1 times [2018-11-10 01:54:20,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:20,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:20,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:20,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:54:20,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:20,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:54:20,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:54:20,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:54:20,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:54:20,712 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2018-11-10 01:54:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:20,802 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-10 01:54:20,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:54:20,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-10 01:54:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:20,803 INFO L225 Difference]: With dead ends: 81 [2018-11-10 01:54:20,804 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 01:54:20,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:54:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 01:54:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2018-11-10 01:54:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 01:54:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-11-10 01:54:20,810 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 17 [2018-11-10 01:54:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:20,810 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-11-10 01:54:20,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:54:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-11-10 01:54:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 01:54:20,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:20,811 INFO L375 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-11-10 01:54:20,811 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:20,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:20,812 INFO L82 PathProgramCache]: Analyzing trace with hash -76843509, now seen corresponding path program 1 times [2018-11-10 01:54:20,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:20,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:20,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:20,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:54:20,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:20,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:54:20,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:54:20,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:54:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:20,865 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 3 states. [2018-11-10 01:54:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:20,887 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-11-10 01:54:20,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:54:20,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 01:54:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:20,888 INFO L225 Difference]: With dead ends: 61 [2018-11-10 01:54:20,888 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 01:54:20,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 01:54:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-10 01:54:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 01:54:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-11-10 01:54:20,892 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 21 [2018-11-10 01:54:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:20,892 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-11-10 01:54:20,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:54:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-10 01:54:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 01:54:20,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:20,892 INFO L375 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-11-10 01:54:20,893 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:20,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:20,893 INFO L82 PathProgramCache]: Analyzing trace with hash -76843508, now seen corresponding path program 1 times [2018-11-10 01:54:20,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:20,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:54:20,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:20,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:54:20,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:54:20,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:54:20,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:54:20,957 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2018-11-10 01:54:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:21,054 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-10 01:54:21,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:54:21,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-10 01:54:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:21,055 INFO L225 Difference]: With dead ends: 71 [2018-11-10 01:54:21,055 INFO L226 Difference]: Without dead ends: 71 [2018-11-10 01:54:21,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:54:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-10 01:54:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-11-10 01:54:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 01:54:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-11-10 01:54:21,059 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 21 [2018-11-10 01:54:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:21,059 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-11-10 01:54:21,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:54:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-11-10 01:54:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 01:54:21,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:21,060 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:21,060 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:21,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash -401987920, now seen corresponding path program 1 times [2018-11-10 01:54:21,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:21,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:21,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:54:21,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:21,123 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:21,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 01:54:21,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:54:21,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-11-10 01:54:21,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 01:54:21,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 01:54:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:54:21,190 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 7 states. [2018-11-10 01:54:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:21,289 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-11-10 01:54:21,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:54:21,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-10 01:54:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:21,290 INFO L225 Difference]: With dead ends: 131 [2018-11-10 01:54:21,290 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 01:54:21,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:54:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 01:54:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2018-11-10 01:54:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 01:54:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-10 01:54:21,296 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 30 [2018-11-10 01:54:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:21,296 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-10 01:54:21,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 01:54:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-10 01:54:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 01:54:21,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:21,298 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:21,298 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:21,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash 423276415, now seen corresponding path program 1 times [2018-11-10 01:54:21,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:21,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:21,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:54:21,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:21,398 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:21,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:21,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:54:21,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:21,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:21,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:54:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:54:21,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:21,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-10 01:54:21,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:54:21,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:54:21,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:54:21,523 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 9 states. [2018-11-10 01:54:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:21,611 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-10 01:54:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:54:21,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-10 01:54:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:21,613 INFO L225 Difference]: With dead ends: 77 [2018-11-10 01:54:21,613 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 01:54:21,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:54:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 01:54:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-11-10 01:54:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 01:54:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-10 01:54:21,618 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 31 [2018-11-10 01:54:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:21,618 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-10 01:54:21,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:54:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-10 01:54:21,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 01:54:21,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:21,619 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:21,619 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:21,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:21,619 INFO L82 PathProgramCache]: Analyzing trace with hash 423276414, now seen corresponding path program 1 times [2018-11-10 01:54:21,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:21,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:54:21,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:21,665 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:21,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:21,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:54:21,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:21,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:21,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 01:54:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 01:54:21,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:21,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-11-10 01:54:21,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 01:54:21,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 01:54:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 01:54:21,737 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 7 states. [2018-11-10 01:54:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:21,789 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-11-10 01:54:21,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:54:21,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-10 01:54:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:21,790 INFO L225 Difference]: With dead ends: 73 [2018-11-10 01:54:21,790 INFO L226 Difference]: Without dead ends: 73 [2018-11-10 01:54:21,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:54:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-10 01:54:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-10 01:54:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 01:54:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-11-10 01:54:21,794 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2018-11-10 01:54:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:21,795 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-11-10 01:54:21,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 01:54:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-11-10 01:54:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 01:54:21,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:21,796 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:21,796 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:21,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash -243995803, now seen corresponding path program 1 times [2018-11-10 01:54:21,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:21,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:54:21,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:21,844 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:21,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:54:21,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:54:21,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-10 01:54:21,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:54:21,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:54:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:54:21,931 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 9 states. [2018-11-10 01:54:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:22,029 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-11-10 01:54:22,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:54:22,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-10 01:54:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:22,030 INFO L225 Difference]: With dead ends: 86 [2018-11-10 01:54:22,030 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 01:54:22,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:54:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 01:54:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2018-11-10 01:54:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 01:54:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-10 01:54:22,034 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 34 [2018-11-10 01:54:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:22,034 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-10 01:54:22,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:54:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-10 01:54:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 01:54:22,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:22,035 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:22,035 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:22,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:22,035 INFO L82 PathProgramCache]: Analyzing trace with hash 291553576, now seen corresponding path program 1 times [2018-11-10 01:54:22,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:22,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:22,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:22,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:54:22,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:22,072 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:22,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:22,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:54:22,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:22,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-10 01:54:22,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:54:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:54:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:54:22,167 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 11 states. [2018-11-10 01:54:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:22,259 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-11-10 01:54:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:54:22,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-10 01:54:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:22,260 INFO L225 Difference]: With dead ends: 109 [2018-11-10 01:54:22,260 INFO L226 Difference]: Without dead ends: 109 [2018-11-10 01:54:22,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 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-11-10 01:54:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-10 01:54:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 86. [2018-11-10 01:54:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 01:54:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-11-10 01:54:22,264 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 36 [2018-11-10 01:54:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:22,265 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-11-10 01:54:22,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:54:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-11-10 01:54:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 01:54:22,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:22,266 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:22,266 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:22,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash 9013725, now seen corresponding path program 1 times [2018-11-10 01:54:22,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:22,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:22,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:22,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:22,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:54:22,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:22,355 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:22,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:22,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:22,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:54:22,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:22,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:54:22,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:22,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:22,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 01:54:22,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:22,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:22,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 01:54:22,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:22,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:22,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-10 01:54:22,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:22,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:22,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-11-10 01:54:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:54:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-10 01:54:22,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:54:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:54:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:54:22,575 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 13 states. [2018-11-10 01:54:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:22,713 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-11-10 01:54:22,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:54:22,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-10 01:54:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:22,714 INFO L225 Difference]: With dead ends: 99 [2018-11-10 01:54:22,715 INFO L226 Difference]: Without dead ends: 99 [2018-11-10 01:54:22,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-11-10 01:54:22,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-10 01:54:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-11-10 01:54:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 01:54:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-10 01:54:22,718 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 40 [2018-11-10 01:54:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:22,719 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-10 01:54:22,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:54:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-10 01:54:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 01:54:22,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:22,720 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:22,720 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:22,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1745908023, now seen corresponding path program 2 times [2018-11-10 01:54:22,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:22,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:22,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 01:54:22,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:22,785 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:22,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:54:22,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:54:22,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:54:22,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 01:54:22,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:22,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-10 01:54:22,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 01:54:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 01:54:22,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:54:22,903 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 15 states. [2018-11-10 01:54:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:23,075 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-11-10 01:54:23,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:54:23,076 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-10 01:54:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:23,077 INFO L225 Difference]: With dead ends: 157 [2018-11-10 01:54:23,077 INFO L226 Difference]: Without dead ends: 157 [2018-11-10 01:54:23,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-10 01:54:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-10 01:54:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 119. [2018-11-10 01:54:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-10 01:54:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2018-11-10 01:54:23,083 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 55 [2018-11-10 01:54:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:23,083 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-11-10 01:54:23,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 01:54:23,084 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2018-11-10 01:54:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 01:54:23,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:23,085 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:23,085 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:23,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:23,085 INFO L82 PathProgramCache]: Analyzing trace with hash 414489196, now seen corresponding path program 2 times [2018-11-10 01:54:23,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:23,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 01:54:23,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:23,192 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/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-11-10 01:54:23,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:54:23,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:54:23,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:54:23,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 01:54:23,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:23,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-11-10 01:54:23,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:54:23,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:54:23,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:54:23,356 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 13 states. [2018-11-10 01:54:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:23,569 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-11-10 01:54:23,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:54:23,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-11-10 01:54:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:23,571 INFO L225 Difference]: With dead ends: 159 [2018-11-10 01:54:23,571 INFO L226 Difference]: Without dead ends: 153 [2018-11-10 01:54:23,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-11-10 01:54:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-10 01:54:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2018-11-10 01:54:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 01:54:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-11-10 01:54:23,575 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 59 [2018-11-10 01:54:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:23,575 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-11-10 01:54:23,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:54:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-11-10 01:54:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 01:54:23,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:23,576 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:23,576 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:23,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:23,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1364563876, now seen corresponding path program 3 times [2018-11-10 01:54:23,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:23,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:23,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:23,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 01:54:23,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:23,692 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:54:23,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:54:23,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 01:54:23,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:54:23,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:23,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:54:23,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:23,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 01:54:23,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:23,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:23,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 01:54:23,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:23,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:23,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-10 01:54:23,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:23,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:23,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:23,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 01:54:23,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:23,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:23,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-11-10 01:54:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 01:54:23,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:23,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-11-10 01:54:23,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:54:23,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:54:23,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:54:23,964 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 14 states. [2018-11-10 01:54:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:24,195 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-11-10 01:54:24,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:54:24,195 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-11-10 01:54:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:24,196 INFO L225 Difference]: With dead ends: 132 [2018-11-10 01:54:24,196 INFO L226 Difference]: Without dead ends: 132 [2018-11-10 01:54:24,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-10 01:54:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-10 01:54:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2018-11-10 01:54:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 01:54:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-11-10 01:54:24,199 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 65 [2018-11-10 01:54:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:24,199 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-11-10 01:54:24,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:54:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-11-10 01:54:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 01:54:24,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:24,201 INFO L375 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:24,201 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:24,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1270672786, now seen corresponding path program 1 times [2018-11-10 01:54:24,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:24,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:24,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:24,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:24,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-10 01:54:24,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:24,270 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:54:24,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:24,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 119 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 01:54:24,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:24,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-10 01:54:24,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 01:54:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 01:54:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:54:24,429 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 15 states. [2018-11-10 01:54:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:24,655 INFO L93 Difference]: Finished difference Result 210 states and 217 transitions. [2018-11-10 01:54:24,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:54:24,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2018-11-10 01:54:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:24,656 INFO L225 Difference]: With dead ends: 210 [2018-11-10 01:54:24,656 INFO L226 Difference]: Without dead ends: 207 [2018-11-10 01:54:24,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-11-10 01:54:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-10 01:54:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 147. [2018-11-10 01:54:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-10 01:54:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-11-10 01:54:24,660 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 105 [2018-11-10 01:54:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:24,661 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-11-10 01:54:24,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 01:54:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-11-10 01:54:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 01:54:24,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:24,663 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:24,663 INFO L424 AbstractCegarLoop]: === Iteration 16 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:24,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:24,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1263168967, now seen corresponding path program 2 times [2018-11-10 01:54:24,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:24,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:24,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:24,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:24,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-10 01:54:24,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:24,731 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:54:24,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:54:24,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 01:54:24,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:54:24,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:24,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:24,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:24,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:24,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:24,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:24,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:24,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:24,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:24,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:24,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:24,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:24,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:24,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:24,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:24,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:24,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:24,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-10 01:54:24,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:24,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 01:54:24,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:24,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:24,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:24,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:24,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:24,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:24,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:25,040 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#b~0.base| 1))) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (select .cse0 |c_main_~#mask~0.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_~#mask~0.base| 1) |main_~#b~0.base| 0))))) is different from true [2018-11-10 01:54:25,045 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int) (|main_~#mask~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#b~0.base| 1))) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (select .cse0 |main_~#mask~0.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_~#mask~0.base| 1) |main_~#b~0.base| 0) |main_~#mask~0.base| 0))))) is different from true [2018-11-10 01:54:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2018-11-10 01:54:25,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:54:25,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-11-10 01:54:25,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 01:54:25,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 01:54:25,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=97, Unknown=2, NotChecked=42, Total=182 [2018-11-10 01:54:25,157 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 14 states. [2018-11-10 01:54:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:25,540 INFO L93 Difference]: Finished difference Result 204 states and 210 transitions. [2018-11-10 01:54:25,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 01:54:25,540 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2018-11-10 01:54:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:25,541 INFO L225 Difference]: With dead ends: 204 [2018-11-10 01:54:25,541 INFO L226 Difference]: Without dead ends: 162 [2018-11-10 01:54:25,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 129 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=694, Unknown=37, NotChecked=118, Total=1056 [2018-11-10 01:54:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-10 01:54:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2018-11-10 01:54:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 01:54:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-11-10 01:54:25,545 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 142 [2018-11-10 01:54:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:25,546 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-11-10 01:54:25,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 01:54:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-11-10 01:54:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 01:54:25,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:25,548 INFO L375 BasicCegarLoop]: trace histogram [18, 12, 12, 12, 12, 12, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:25,548 INFO L424 AbstractCegarLoop]: === Iteration 17 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:25,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash -730868092, now seen corresponding path program 1 times [2018-11-10 01:54:25,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:25,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:25,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:25,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:25,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2018-11-10 01:54:25,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:25,649 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:54:25,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:25,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 515 proven. 24 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-10 01:54:25,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:54:25,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-11-10 01:54:25,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 01:54:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 01:54:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-10 01:54:25,785 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 19 states. [2018-11-10 01:54:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:26,021 INFO L93 Difference]: Finished difference Result 243 states and 254 transitions. [2018-11-10 01:54:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 01:54:26,021 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 201 [2018-11-10 01:54:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:26,022 INFO L225 Difference]: With dead ends: 243 [2018-11-10 01:54:26,022 INFO L226 Difference]: Without dead ends: 243 [2018-11-10 01:54:26,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-11-10 01:54:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-10 01:54:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 196. [2018-11-10 01:54:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-11-10 01:54:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 203 transitions. [2018-11-10 01:54:26,026 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 203 transitions. Word has length 201 [2018-11-10 01:54:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:26,026 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 203 transitions. [2018-11-10 01:54:26,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 01:54:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 203 transitions. [2018-11-10 01:54:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-10 01:54:26,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:54:26,028 INFO L375 BasicCegarLoop]: trace histogram [25, 18, 18, 18, 18, 18, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:26,029 INFO L424 AbstractCegarLoop]: === Iteration 18 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION]=== [2018-11-10 01:54:26,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1524605645, now seen corresponding path program 2 times [2018-11-10 01:54:26,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:26,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:26,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1415 trivial. 0 not checked. [2018-11-10 01:54:26,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:54:26,144 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:54:26,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:54:26,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 01:54:26,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:54:26,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:54:26,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:26,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:26,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:26,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:26,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:26,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:26,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:26,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:26,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:26,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:26,290 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:26,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:26,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:26,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:26,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:26,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:26,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:26,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:26,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:26,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:26,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:26,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:26,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:26,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:26,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:26,444 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:26,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:26,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:26,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:26,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:26,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:54:26,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-10 01:54:26,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 01:54:26,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:54:26,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:54:26,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 01:54:26,540 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#b~0.base| 1))) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (select .cse0 |c_main_~#mask~0.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_~#mask~0.base| 1) |main_~#b~0.base| 0))))) is different from true [2018-11-10 01:54:26,543 WARN L854 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int) (|main_~#mask~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#b~0.base| 1))) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (select .cse0 |main_~#mask~0.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_~#mask~0.base| 1) |main_~#b~0.base| 0) |main_~#mask~0.base| 0))))) is different from true [2018-11-10 01:54:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1576 trivial. 0 not checked. [2018-11-10 01:54:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:54:26,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2018-11-10 01:54:26,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 01:54:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 01:54:26,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=130, Unknown=2, NotChecked=50, Total=240 [2018-11-10 01:54:26,683 INFO L87 Difference]: Start difference. First operand 196 states and 203 transitions. Second operand 16 states. [2018-11-10 01:54:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:26,948 INFO L93 Difference]: Finished difference Result 215 states and 224 transitions. [2018-11-10 01:54:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:54:26,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 255 [2018-11-10 01:54:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:54:26,948 INFO L225 Difference]: With dead ends: 215 [2018-11-10 01:54:26,949 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 01:54:26,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 238 SyntacticMatches, 13 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=354, Unknown=2, NotChecked=86, Total=600 [2018-11-10 01:54:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 01:54:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 01:54:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 01:54:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 01:54:26,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2018-11-10 01:54:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:54:26,950 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:54:26,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 01:54:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 01:54:26,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 01:54:26,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:54:26 BoogieIcfgContainer [2018-11-10 01:54:26,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:54:26,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:54:26,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:54:26,954 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:54:26,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:54:20" (3/4) ... [2018-11-10 01:54:26,957 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 01:54:26,961 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 01:54:26,961 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-10 01:54:26,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 01:54:26,964 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-10 01:54:26,965 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 01:54:26,965 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 01:54:26,965 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 01:54:26,990 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d584796-7183-4bf3-a1b9-4b5dd876f57d/bin-2019/uautomizer/witness.graphml [2018-11-10 01:54:26,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:54:26,991 INFO L168 Benchmark]: Toolchain (without parser) took 7101.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.3 MB). Free memory was 963.0 MB in the beginning and 1.2 GB in the end (delta: -283.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:54:26,992 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:54:26,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.65 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:26,992 INFO L168 Benchmark]: Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:26,992 INFO L168 Benchmark]: RCFGBuilder took 259.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:26,993 INFO L168 Benchmark]: TraceAbstraction took 6624.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:26,993 INFO L168 Benchmark]: Witness Printer took 36.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:54:26,994 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.65 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.28 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 259.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6624.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Witness Printer took 36.50 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: 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, 55 locations, 8 error locations. SAFE Result, 6.5s OverallTime, 18 OverallIterations, 25 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 768 SDtfs, 1932 SDslu, 2724 SDs, 0 SdLazy, 2946 SolverSat, 414 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1280 GetRequests, 1011 SyntacticMatches, 39 SemanticMatches, 230 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=17, 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, 18 MinimizatonAttempts, 324 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2258 NumberOfCodeBlocks, 1880 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2227 ConstructedInterpolants, 315 QuantifiedInterpolants, 2015839 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2111 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 6014/6532 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...