./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.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_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 07b05923cf5c1b39a35ab81b524575a0a488c268 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:12:59,781 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:12:59,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:12:59,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:12:59,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:12:59,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:12:59,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:12:59,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:12:59,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:12:59,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:12:59,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:12:59,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:12:59,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:12:59,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:12:59,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:12:59,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:12:59,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:12:59,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:12:59,803 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:12:59,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:12:59,806 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:12:59,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:12:59,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:12:59,809 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:12:59,809 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:12:59,810 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:12:59,811 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:12:59,812 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:12:59,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:12:59,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:12:59,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:12:59,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:12:59,815 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:12:59,815 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:12:59,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:12:59,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:12:59,816 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-10 12:12:59,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:12:59,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:12:59,829 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:12:59,829 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:12:59,829 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:12:59,829 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:12:59,829 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:12:59,830 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:12:59,831 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:12:59,831 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:12:59,831 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:12:59,831 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:12:59,831 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:12:59,831 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:12:59,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:12:59,833 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:12:59,833 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:12:59,833 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_a96fb524-7002-4825-9d56-571cd53c0dbd/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 -> 07b05923cf5c1b39a35ab81b524575a0a488c268 [2018-11-10 12:12:59,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:12:59,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:12:59,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:12:59,870 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:12:59,870 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:12:59,871 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-11-10 12:12:59,911 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/data/101036bdb/0730795088da4f039df74ff988839435/FLAG791ec491a [2018-11-10 12:13:00,271 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:13:00,271 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-11-10 12:13:00,277 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/data/101036bdb/0730795088da4f039df74ff988839435/FLAG791ec491a [2018-11-10 12:13:00,288 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/data/101036bdb/0730795088da4f039df74ff988839435 [2018-11-10 12:13:00,290 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:13:00,291 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:13:00,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:13:00,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:13:00,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:13:00,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d360f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00, skipping insertion in model container [2018-11-10 12:13:00,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:13:00,319 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:13:00,428 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:13:00,435 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:13:00,447 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:13:00,457 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:13:00,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00 WrapperNode [2018-11-10 12:13:00,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:13:00,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:13:00,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:13:00,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:13:00,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (1/1) ... [2018-11-10 12:13:00,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:13:00,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:13:00,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:13:00,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:13:00,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:00,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:13:00,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:13:00,571 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-10 12:13:00,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:13:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-10 12:13:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:13:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:13:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 12:13:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:13:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 12:13:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:13:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:13:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 12:13:00,743 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:13:00,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:13:00 BoogieIcfgContainer [2018-11-10 12:13:00,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:13:00,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:13:00,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:13:00,746 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:13:00,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:13:00" (1/3) ... [2018-11-10 12:13:00,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99ae372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:13:00, skipping insertion in model container [2018-11-10 12:13:00,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:13:00" (2/3) ... [2018-11-10 12:13:00,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99ae372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:13:00, skipping insertion in model container [2018-11-10 12:13:00,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:13:00" (3/3) ... [2018-11-10 12:13:00,749 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2018-11-10 12:13:00,755 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:13:00,760 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 12:13:00,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 12:13:00,794 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:13:00,794 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:13:00,795 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-10 12:13:00,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:13:00,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:13:00,795 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:13:00,795 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:13:00,795 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:13:00,795 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:13:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-10 12:13:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 12:13:00,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:00,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:00,822 INFO L424 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:00,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:00,826 INFO L82 PathProgramCache]: Analyzing trace with hash 171629076, now seen corresponding path program 1 times [2018-11-10 12:13:00,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:00,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:00,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:00,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:00,917 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 12:13:00,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:13:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:13:00,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:13:00,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:13:00,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:13:00,933 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2018-11-10 12:13:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:00,945 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-11-10 12:13:00,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:13:00,946 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-10 12:13:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:00,953 INFO L225 Difference]: With dead ends: 55 [2018-11-10 12:13:00,953 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 12:13:00,954 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 12:13:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 12:13:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-10 12:13:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 12:13:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-10 12:13:00,980 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 15 [2018-11-10 12:13:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:00,980 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-10 12:13:00,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:13:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-10 12:13:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 12:13:00,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:00,981 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:00,981 INFO L424 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:00,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash 583043534, now seen corresponding path program 1 times [2018-11-10 12:13:00,981 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:00,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:00,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:00,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:00,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:01,021 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 12:13:01,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:13:01,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:13:01,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:13:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:13:01,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:13:01,026 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 3 states. [2018-11-10 12:13:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:01,090 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-10 12:13:01,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:13:01,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-10 12:13:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:01,092 INFO L225 Difference]: With dead ends: 75 [2018-11-10 12:13:01,092 INFO L226 Difference]: Without dead ends: 75 [2018-11-10 12:13:01,092 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 12:13:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-10 12:13:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2018-11-10 12:13:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 12:13:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-10 12:13:01,099 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-11-10 12:13:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:01,100 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 12:13:01,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:13:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-10 12:13:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 12:13:01,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:01,100 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 12:13:01,101 INFO L424 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:01,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash 986062039, now seen corresponding path program 1 times [2018-11-10 12:13:01,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:01,145 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 12:13:01,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:13:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:13:01,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:13:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:13:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:13:01,146 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 3 states. [2018-11-10 12:13:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:01,198 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-10 12:13:01,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:13:01,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-10 12:13:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:01,200 INFO L225 Difference]: With dead ends: 67 [2018-11-10 12:13:01,200 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 12:13:01,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:13:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 12:13:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2018-11-10 12:13:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 12:13:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-10 12:13:01,204 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 17 [2018-11-10 12:13:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:01,204 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-10 12:13:01,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:13:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-10 12:13:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 12:13:01,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:01,205 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:01,205 INFO L424 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:01,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash 503152184, now seen corresponding path program 1 times [2018-11-10 12:13:01,206 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:01,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:01,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:01,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:01,300 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 12:13:01,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:13:01,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:13:01,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 12:13:01,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 12:13:01,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 12:13:01,301 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 7 states. [2018-11-10 12:13:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:01,436 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-10 12:13:01,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:13:01,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-10 12:13:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:01,437 INFO L225 Difference]: With dead ends: 61 [2018-11-10 12:13:01,438 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 12:13:01,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:13:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 12:13:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-11-10 12:13:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 12:13:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-10 12:13:01,442 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 18 [2018-11-10 12:13:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:01,442 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-10 12:13:01,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 12:13:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-10 12:13:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 12:13:01,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:01,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:01,444 INFO L424 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:01,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash 503152183, now seen corresponding path program 1 times [2018-11-10 12:13:01,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:01,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:01,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:01,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:01,486 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 12:13:01,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:13:01,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:13:01,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:13:01,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:13:01,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:13:01,488 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2018-11-10 12:13:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:01,559 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-10 12:13:01,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:13:01,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-10 12:13:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:01,560 INFO L225 Difference]: With dead ends: 57 [2018-11-10 12:13:01,560 INFO L226 Difference]: Without dead ends: 57 [2018-11-10 12:13:01,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:13:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-10 12:13:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-10 12:13:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 12:13:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-10 12:13:01,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 18 [2018-11-10 12:13:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:01,565 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-10 12:13:01,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:13:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-10 12:13:01,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:13:01,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:01,565 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 12:13:01,566 INFO L424 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:01,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:01,566 INFO L82 PathProgramCache]: Analyzing trace with hash -76843509, now seen corresponding path program 1 times [2018-11-10 12:13:01,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:01,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:01,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:01,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:01,632 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 12:13:01,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:13:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:13:01,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:13:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:13:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:13:01,633 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2018-11-10 12:13:01,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:01,668 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-11-10 12:13:01,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:13:01,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-10 12:13:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:01,669 INFO L225 Difference]: With dead ends: 63 [2018-11-10 12:13:01,670 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 12:13:01,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:13:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 12:13:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-10 12:13:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 12:13:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-11-10 12:13:01,675 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 21 [2018-11-10 12:13:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:01,676 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-11-10 12:13:01,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:13:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-11-10 12:13:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:13:01,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:01,677 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:01,677 INFO L424 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:01,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:01,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2011119119, now seen corresponding path program 1 times [2018-11-10 12:13:01,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:01,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:01,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:01,750 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:01,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:01,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:01,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:13:01,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2018-11-10 12:13:01,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:13:01,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:13:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:13:01,846 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 9 states. [2018-11-10 12:13:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:01,950 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-11-10 12:13:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:13:01,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-10 12:13:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:01,956 INFO L225 Difference]: With dead ends: 67 [2018-11-10 12:13:01,956 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 12:13:01,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:13:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 12:13:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-10 12:13:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 12:13:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-10 12:13:01,961 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 23 [2018-11-10 12:13:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:01,961 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-10 12:13:01,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:13:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-10 12:13:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 12:13:01,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:01,963 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:01,963 INFO L424 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:01,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:01,963 INFO L82 PathProgramCache]: Analyzing trace with hash -856954957, now seen corresponding path program 1 times [2018-11-10 12:13:01,964 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:01,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:02,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:02,111 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:02,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:02,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:02,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:13:02,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-10 12:13:02,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:13:02,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:13:02,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:13:02,245 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 12 states. [2018-11-10 12:13:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:02,394 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-10 12:13:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:13:02,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-10 12:13:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:02,397 INFO L225 Difference]: With dead ends: 80 [2018-11-10 12:13:02,397 INFO L226 Difference]: Without dead ends: 77 [2018-11-10 12:13:02,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:13:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-10 12:13:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-11-10 12:13:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 12:13:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-11-10 12:13:02,403 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 39 [2018-11-10 12:13:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:02,404 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-11-10 12:13:02,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:13:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-10 12:13:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 12:13:02,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:02,405 INFO L375 BasicCegarLoop]: trace histogram [5, 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] [2018-11-10 12:13:02,405 INFO L424 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:02,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:02,406 INFO L82 PathProgramCache]: Analyzing trace with hash -522203413, now seen corresponding path program 2 times [2018-11-10 12:13:02,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:02,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:02,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:02,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:02,556 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:13:02,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:13:02,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:13:02,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:02,603 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 12:13:02,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:02,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:13:02,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 12:13:02,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-11-10 12:13:02,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:02,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:13:02,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-11-10 12:13:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 12:13:02,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:13:02,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-10 12:13:02,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:13:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:13:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:13:02,702 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 10 states. [2018-11-10 12:13:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:02,880 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-10 12:13:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:13:02,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-10 12:13:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:02,881 INFO L225 Difference]: With dead ends: 84 [2018-11-10 12:13:02,881 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 12:13:02,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:13:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 12:13:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-11-10 12:13:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-10 12:13:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-10 12:13:02,885 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 45 [2018-11-10 12:13:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:02,885 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-10 12:13:02,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:13:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-10 12:13:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 12:13:02,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:02,886 INFO L375 BasicCegarLoop]: trace histogram [6, 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] [2018-11-10 12:13:02,887 INFO L424 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:02,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:02,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1147628580, now seen corresponding path program 1 times [2018-11-10 12:13:02,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:02,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:02,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:02,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:02,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:03,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:03,054 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:03,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:03,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:03,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:13:03,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-10 12:13:03,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 12:13:03,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 12:13:03,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:13:03,185 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 16 states. [2018-11-10 12:13:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:03,390 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-11-10 12:13:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:13:03,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-10 12:13:03,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:03,391 INFO L225 Difference]: With dead ends: 90 [2018-11-10 12:13:03,391 INFO L226 Difference]: Without dead ends: 87 [2018-11-10 12:13:03,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-11-10 12:13:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-10 12:13:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-10 12:13:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 12:13:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-11-10 12:13:03,396 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 51 [2018-11-10 12:13:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:03,396 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-11-10 12:13:03,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 12:13:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-11-10 12:13:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 12:13:03,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:03,397 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:03,398 INFO L424 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:03,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:03,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1801600860, now seen corresponding path program 2 times [2018-11-10 12:13:03,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:03,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:03,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:03,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:03,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:03,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:03,590 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:03,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:13:03,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:13:03,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:13:03,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:03,626 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 12:13:03,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:03,636 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 12:13:03,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:03,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:13:03,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-10 12:13:03,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:03,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:03,661 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 12:13:03,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:03,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:03,669 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 12:13:03,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:03,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:13:03,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:13:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-10 12:13:03,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:13:03,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2018-11-10 12:13:03,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 12:13:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 12:13:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:13:03,817 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 15 states. [2018-11-10 12:13:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:04,093 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-11-10 12:13:04,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:13:04,094 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-10 12:13:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:04,094 INFO L225 Difference]: With dead ends: 94 [2018-11-10 12:13:04,094 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 12:13:04,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-11-10 12:13:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 12:13:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-11-10 12:13:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 12:13:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-11-10 12:13:04,097 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 57 [2018-11-10 12:13:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:04,098 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-11-10 12:13:04,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 12:13:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-11-10 12:13:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 12:13:04,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:04,099 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:04,099 INFO L424 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:04,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2128189257, now seen corresponding path program 1 times [2018-11-10 12:13:04,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:04,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:04,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:04,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:04,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-10 12:13:04,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:04,151 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:04,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:04,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:13:04,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:13:04,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 13 [2018-11-10 12:13:04,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:13:04,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:13:04,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:13:04,326 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 13 states. [2018-11-10 12:13:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:04,442 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-11-10 12:13:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:13:04,442 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2018-11-10 12:13:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:04,443 INFO L225 Difference]: With dead ends: 134 [2018-11-10 12:13:04,443 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 12:13:04,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:13:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 12:13:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2018-11-10 12:13:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 12:13:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-11-10 12:13:04,447 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 78 [2018-11-10 12:13:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:04,447 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-11-10 12:13:04,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:13:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-11-10 12:13:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 12:13:04,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:04,450 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 16, 16, 16, 16, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:04,450 INFO L424 AbstractCegarLoop]: === Iteration 13 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:04,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:04,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1190725574, now seen corresponding path program 2 times [2018-11-10 12:13:04,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:04,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:04,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2018-11-10 12:13:04,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:04,508 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:13:04,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:13:04,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:13:04,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:04,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:04,599 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 12:13:04,601 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 12:13:04,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:04,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:13:04,609 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 12:13:04,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:13:04,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:04,685 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 12:13:04,687 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 12:13:04,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:04,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:13:04,694 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 12:13:04,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:13:04,745 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 12:13:04,764 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 12:13:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-11-10 12:13:04,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:13:04,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2018-11-10 12:13:04,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:13:04,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:13:04,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=55, Unknown=2, NotChecked=30, Total=110 [2018-11-10 12:13:04,853 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 11 states. [2018-11-10 12:13:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:05,121 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2018-11-10 12:13:05,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:13:05,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2018-11-10 12:13:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:05,123 INFO L225 Difference]: With dead ends: 144 [2018-11-10 12:13:05,123 INFO L226 Difference]: Without dead ends: 120 [2018-11-10 12:13:05,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=256, Unknown=13, NotChecked=70, Total=420 [2018-11-10 12:13:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-10 12:13:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-11-10 12:13:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 12:13:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-11-10 12:13:05,126 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 145 [2018-11-10 12:13:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:05,127 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-11-10 12:13:05,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:13:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-11-10 12:13:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 12:13:05,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:05,129 INFO L375 BasicCegarLoop]: trace histogram [27, 24, 24, 24, 24, 24, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:13:05,129 INFO L424 AbstractCegarLoop]: === Iteration 14 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:05,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash -79499043, now seen corresponding path program 1 times [2018-11-10 12:13:05,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:05,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:05,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:05,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:13:05,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1866 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1839 trivial. 0 not checked. [2018-11-10 12:13:05,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:05,214 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:05,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:05,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1866 backedges. 852 proven. 184 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2018-11-10 12:13:05,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:13:05,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 16 [2018-11-10 12:13:05,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 12:13:05,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 12:13:05,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-11-10 12:13:05,396 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 16 states. [2018-11-10 12:13:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:05,484 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2018-11-10 12:13:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 12:13:05,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 219 [2018-11-10 12:13:05,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:05,486 INFO L225 Difference]: With dead ends: 145 [2018-11-10 12:13:05,486 INFO L226 Difference]: Without dead ends: 142 [2018-11-10 12:13:05,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:13:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-10 12:13:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2018-11-10 12:13:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 12:13:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2018-11-10 12:13:05,491 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 219 [2018-11-10 12:13:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:05,491 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2018-11-10 12:13:05,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 12:13:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2018-11-10 12:13:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-10 12:13:05,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:13:05,498 INFO L375 BasicCegarLoop]: trace histogram [40, 36, 36, 36, 36, 36, 5, 5, 4, 4, 4, 4, 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] [2018-11-10 12:13:05,498 INFO L424 AbstractCegarLoop]: === Iteration 15 === [fooErr2REQUIRES_VIOLATION, fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-11-10 12:13:05,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:13:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash 224292436, now seen corresponding path program 2 times [2018-11-10 12:13:05,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:13:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:13:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:05,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:13:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:13:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:13:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4192 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4142 trivial. 0 not checked. [2018-11-10 12:13:05,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:13:05,647 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/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 12:13:05,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:13:05,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 12:13:05,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:13:05,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:13:05,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:05,701 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 12:13:05,703 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 12:13:05,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:05,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:13:05,718 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 12:13:05,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:13:05,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:05,780 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 12:13:05,783 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 12:13:05,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:05,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:13:05,791 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 12:13:05,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:13:05,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:05,871 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 12:13:05,873 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 12:13:05,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:05,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:13:05,895 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 12:13:05,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:13:05,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:13:05,947 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 12:13:05,948 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 12:13:05,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:13:05,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:13:05,954 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 12:13:05,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-10 12:13:05,989 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 12:13:05,992 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 12:13:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4192 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4192 trivial. 0 not checked. [2018-11-10 12:13:06,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:13:06,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-11-10 12:13:06,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:13:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:13:06,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=82, Unknown=2, NotChecked=38, Total=156 [2018-11-10 12:13:06,194 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand 13 states. [2018-11-10 12:13:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:13:06,405 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-11-10 12:13:06,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:13:06,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 309 [2018-11-10 12:13:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:13:06,406 INFO L225 Difference]: With dead ends: 149 [2018-11-10 12:13:06,407 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:13:06,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 298 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=195, Unknown=2, NotChecked=62, Total=342 [2018-11-10 12:13:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:13:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:13:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:13:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:13:06,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 309 [2018-11-10 12:13:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:13:06,408 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:13:06,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:13:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:13:06,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:13:06,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:13:06 BoogieIcfgContainer [2018-11-10 12:13:06,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:13:06,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:13:06,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:13:06,414 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:13:06,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:13:00" (3/4) ... [2018-11-10 12:13:06,418 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:13:06,424 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:13:06,424 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-10 12:13:06,424 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:13:06,427 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-10 12:13:06,428 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 12:13:06,428 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 12:13:06,428 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:13:06,467 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a96fb524-7002-4825-9d56-571cd53c0dbd/bin-2019/uautomizer/witness.graphml [2018-11-10 12:13:06,467 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:13:06,468 INFO L168 Benchmark]: Toolchain (without parser) took 6177.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -256.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:06,469 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:13:06,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.29 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:06,471 INFO L168 Benchmark]: Boogie Preprocessor took 28.74 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:06,472 INFO L168 Benchmark]: RCFGBuilder took 255.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:06,472 INFO L168 Benchmark]: TraceAbstraction took 5670.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.0 MB). Peak memory consumption was 126.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:06,472 INFO L168 Benchmark]: Witness Printer took 53.05 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:13:06,474 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.29 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.74 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 255.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5670.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 212.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.0 MB). Peak memory consumption was 126.4 MB. Max. memory is 11.5 GB. * Witness Printer took 53.05 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. 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: 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 - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 8 error locations. SAFE Result, 5.6s OverallTime, 15 OverallIterations, 40 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 611 SDtfs, 864 SDslu, 2318 SDs, 0 SdLazy, 1385 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1103 GetRequests, 922 SyntacticMatches, 13 SemanticMatches, 168 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 95 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2037 NumberOfCodeBlocks, 1567 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2013 ConstructedInterpolants, 434 QuantifiedInterpolants, 2482875 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1336 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 13736/14488 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...