./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10cd30ad3ca5cbac349bf58887b96141941b6c91 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 00:48:48,696 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:48:48,698 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:48:48,706 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:48:48,706 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:48:48,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:48:48,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:48:48,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:48:48,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:48:48,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:48:48,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:48:48,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:48:48,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:48:48,711 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:48:48,712 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:48:48,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:48:48,713 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:48:48,713 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:48:48,715 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:48:48,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:48:48,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:48:48,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:48:48,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:48:48,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:48:48,718 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:48:48,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:48:48,718 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:48:48,719 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:48:48,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:48:48,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:48:48,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:48:48,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:48:48,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:48:48,720 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:48:48,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:48:48,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:48:48,721 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 00:48:48,728 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:48:48,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:48:48,728 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 00:48:48,729 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 00:48:48,729 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 00:48:48,729 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 00:48:48,729 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 00:48:48,729 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:48:48,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 00:48:48,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:48:48,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 00:48:48,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 00:48:48,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 00:48:48,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:48:48,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:48:48,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 00:48:48,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 00:48:48,731 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 00:48:48,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 00:48:48,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 00:48:48,731 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/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 ! call(__VERIFIER_error())) ) 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 -> 10cd30ad3ca5cbac349bf58887b96141941b6c91 [2018-12-02 00:48:48,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:48:48,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:48:48,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:48:48,758 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:48:48,758 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:48:48,759 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-12-02 00:48:48,793 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/data/c184f05eb/f1295f59b02c4cc4bd42b7805cb7ce58/FLAGb87b768d5 [2018-12-02 00:48:49,128 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:48:49,129 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-12-02 00:48:49,135 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/data/c184f05eb/f1295f59b02c4cc4bd42b7805cb7ce58/FLAGb87b768d5 [2018-12-02 00:48:49,518 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/data/c184f05eb/f1295f59b02c4cc4bd42b7805cb7ce58 [2018-12-02 00:48:49,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:48:49,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:48:49,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:48:49,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:48:49,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:48:49,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edf91ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49, skipping insertion in model container [2018-12-02 00:48:49,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:48:49,549 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:48:49,691 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:48:49,694 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:48:49,716 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:48:49,795 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:48:49,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49 WrapperNode [2018-12-02 00:48:49,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:48:49,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:48:49,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:48:49,797 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:48:49,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:48:49,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:48:49,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:48:49,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:48:49,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... [2018-12-02 00:48:49,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:48:49,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:48:49,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:48:49,838 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:48:49,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:48:49,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 00:48:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2018-12-02 00:48:49,875 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2018-12-02 00:48:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 00:48:49,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 00:48:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 00:48:49,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 00:48:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-12-02 00:48:49,875 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-12-02 00:48:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 00:48:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-12-02 00:48:49,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-12-02 00:48:49,875 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-12-02 00:48:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-12-02 00:48:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2018-12-02 00:48:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2018-12-02 00:48:49,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:48:49,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:48:50,028 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:48:50,029 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 00:48:50,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:48:50 BoogieIcfgContainer [2018-12-02 00:48:50,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:48:50,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 00:48:50,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 00:48:50,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 00:48:50,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:48:49" (1/3) ... [2018-12-02 00:48:50,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:48:50, skipping insertion in model container [2018-12-02 00:48:50,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:48:49" (2/3) ... [2018-12-02 00:48:50,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:48:50, skipping insertion in model container [2018-12-02 00:48:50,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:48:50" (3/3) ... [2018-12-02 00:48:50,033 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_true-unreach-call.i [2018-12-02 00:48:50,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 00:48:50,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 00:48:50,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 00:48:50,070 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 00:48:50,070 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 00:48:50,070 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 00:48:50,070 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 00:48:50,070 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 00:48:50,070 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 00:48:50,070 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 00:48:50,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 00:48:50,071 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 00:48:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-02 00:48:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 00:48:50,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:48:50,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:48:50,085 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:48:50,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:48:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash 713355486, now seen corresponding path program 1 times [2018-12-02 00:48:50,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:48:50,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:48:50,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:50,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:50,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:48:50,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:48:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:48:50,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:48:50,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:48:50,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:48:50,224 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 6 states. [2018-12-02 00:48:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:48:50,280 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-12-02 00:48:50,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:48:50,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-02 00:48:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:48:50,286 INFO L225 Difference]: With dead ends: 84 [2018-12-02 00:48:50,286 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 00:48:50,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-12-02 00:48:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 00:48:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-02 00:48:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 00:48:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-02 00:48:50,312 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2018-12-02 00:48:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:48:50,312 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-02 00:48:50,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:48:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-02 00:48:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 00:48:50,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:48:50,313 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:48:50,313 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:48:50,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:48:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1315059296, now seen corresponding path program 1 times [2018-12-02 00:48:50,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:48:50,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:48:50,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:50,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:50,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:48:50,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:48:50,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:48:50,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:48:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:48:50,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:48:50,392 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-12-02 00:48:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:48:50,407 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-12-02 00:48:50,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:48:50,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-12-02 00:48:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:48:50,409 INFO L225 Difference]: With dead ends: 63 [2018-12-02 00:48:50,409 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 00:48:50,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:48:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 00:48:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 00:48:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 00:48:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-02 00:48:50,415 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 38 [2018-12-02 00:48:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:48:50,415 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-02 00:48:50,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:48:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-02 00:48:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 00:48:50,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:48:50,416 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 00:48:50,416 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:48:50,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:48:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1021656289, now seen corresponding path program 1 times [2018-12-02 00:48:50,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:48:50,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:48:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:50,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:48:50,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:48:50,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:48:50,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:50,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:48:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 00:48:50,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 00:48:50,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-12-02 00:48:50,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 00:48:50,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 00:48:50,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 00:48:50,744 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 18 states. [2018-12-02 00:48:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:48:51,221 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2018-12-02 00:48:51,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 00:48:51,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-12-02 00:48:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:48:51,222 INFO L225 Difference]: With dead ends: 94 [2018-12-02 00:48:51,222 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 00:48:51,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 00:48:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 00:48:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-12-02 00:48:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 00:48:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-02 00:48:51,228 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 38 [2018-12-02 00:48:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:48:51,229 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-02 00:48:51,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 00:48:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-02 00:48:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 00:48:51,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:48:51,229 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:48:51,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:48:51,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:48:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1531629844, now seen corresponding path program 1 times [2018-12-02 00:48:51,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:48:51,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:48:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:51,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:48:51,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:48:51,393 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:48:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:51,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:48:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:48:51,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:48:51,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2018-12-02 00:48:51,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 00:48:51,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 00:48:51,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-12-02 00:48:51,530 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 24 states. [2018-12-02 00:48:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:48:51,888 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-12-02 00:48:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 00:48:51,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-02 00:48:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:48:51,889 INFO L225 Difference]: With dead ends: 62 [2018-12-02 00:48:51,889 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 00:48:51,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 00:48:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 00:48:51,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-02 00:48:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 00:48:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-12-02 00:48:51,894 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 45 [2018-12-02 00:48:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:48:51,895 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-12-02 00:48:51,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 00:48:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-12-02 00:48:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 00:48:51,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:48:51,895 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:48:51,895 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:48:51,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:48:51,896 INFO L82 PathProgramCache]: Analyzing trace with hash 722283218, now seen corresponding path program 1 times [2018-12-02 00:48:51,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:48:51,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:48:51,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:51,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:51,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:52,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:48:52,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:48:52,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:48:52,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:52,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:48:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:48:52,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:48:52,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-12-02 00:48:52,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 00:48:52,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 00:48:52,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-12-02 00:48:52,216 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 26 states. [2018-12-02 00:48:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:48:52,686 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-12-02 00:48:52,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 00:48:52,687 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-12-02 00:48:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:48:52,687 INFO L225 Difference]: With dead ends: 70 [2018-12-02 00:48:52,688 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 00:48:52,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 00:48:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 00:48:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-12-02 00:48:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 00:48:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-02 00:48:52,696 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 45 [2018-12-02 00:48:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:48:52,696 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-02 00:48:52,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 00:48:52,696 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-02 00:48:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 00:48:52,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:48:52,698 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:48:52,698 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:48:52,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:48:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1421196377, now seen corresponding path program 1 times [2018-12-02 00:48:52,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:48:52,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:48:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:52,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:52,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 00:48:52,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:48:52,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:48:52,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:52,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:48:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 00:48:53,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:48:53,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2018-12-02 00:48:53,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 00:48:53,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 00:48:53,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 00:48:53,136 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 34 states. [2018-12-02 00:48:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:48:53,910 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-02 00:48:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 00:48:53,910 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 57 [2018-12-02 00:48:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:48:53,911 INFO L225 Difference]: With dead ends: 74 [2018-12-02 00:48:53,911 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 00:48:53,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=3045, Unknown=0, NotChecked=0, Total=3422 [2018-12-02 00:48:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 00:48:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-12-02 00:48:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 00:48:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-12-02 00:48:53,916 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 57 [2018-12-02 00:48:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:48:53,916 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-02 00:48:53,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 00:48:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-12-02 00:48:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 00:48:53,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:48:53,917 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:48:53,917 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:48:53,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:48:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2064424293, now seen corresponding path program 1 times [2018-12-02 00:48:53,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:48:53,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:48:53,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:53,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:53,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 00:48:54,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:48:54,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:48:54,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:54,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:48:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 00:48:54,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:48:54,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 26 [2018-12-02 00:48:54,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 00:48:54,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 00:48:54,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-12-02 00:48:54,218 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 26 states. [2018-12-02 00:48:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:48:54,629 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-02 00:48:54,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 00:48:54,629 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-12-02 00:48:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:48:54,629 INFO L225 Difference]: With dead ends: 61 [2018-12-02 00:48:54,629 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 00:48:54,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 00:48:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 00:48:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-02 00:48:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 00:48:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-02 00:48:54,633 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 57 [2018-12-02 00:48:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:48:54,634 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-02 00:48:54,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 00:48:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-02 00:48:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 00:48:54,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:48:54,634 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:48:54,634 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:48:54,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:48:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1477618279, now seen corresponding path program 1 times [2018-12-02 00:48:54,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 00:48:54,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 00:48:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:54,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:48:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:48:54,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 00:48:54,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 00:48:54,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:48:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:48:54,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 00:48:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 00:48:54,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 00:48:54,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-02 00:48:54,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 00:48:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 00:48:54,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:48:54,795 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 9 states. [2018-12-02 00:48:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:48:54,885 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-02 00:48:54,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:48:54,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-12-02 00:48:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:48:54,885 INFO L225 Difference]: With dead ends: 47 [2018-12-02 00:48:54,885 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 00:48:54,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-12-02 00:48:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 00:48:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 00:48:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 00:48:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 00:48:54,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-12-02 00:48:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:48:54,886 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 00:48:54,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 00:48:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 00:48:54,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 00:48:54,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 00:48:55,413 INFO L448 ceAbstractionStarter]: For program point my_mallocFINAL(lines 878 880) no Hoare annotation was computed. [2018-12-02 00:48:55,413 INFO L444 ceAbstractionStarter]: At program point L879(line 879) the Hoare annotation is: (let ((.cse1 (= 8 my_malloc_~size)) (.cse0 (not (= 8 |my_malloc_#in~size|)))) (and (or (or (not (= ~elem~0.offset 0)) (or (< |old(~guard_malloc_counter~0.offset)| 0) .cse0)) (and .cse1 (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))) (or (and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) .cse1) (< |old(~guard_malloc_counter~0.offset)| 1) .cse0 (< 0 ~elem~0.offset)))) [2018-12-02 00:48:55,413 INFO L448 ceAbstractionStarter]: For program point L879-1(line 879) no Hoare annotation was computed. [2018-12-02 00:48:55,413 INFO L444 ceAbstractionStarter]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= 8 |my_malloc_#in~size|)))) (and (or (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (< |old(~guard_malloc_counter~0.offset)| 1) .cse0 (< 0 ~elem~0.offset)) (or (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (or (not (= ~elem~0.offset 0)) (or (< |old(~guard_malloc_counter~0.offset)| 0) .cse0))))) [2018-12-02 00:48:55,413 INFO L448 ceAbstractionStarter]: For program point my_mallocEXIT(lines 878 880) no Hoare annotation was computed. [2018-12-02 00:48:55,413 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 00:48:55,413 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) [2018-12-02 00:48:55,413 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 00:48:55,413 INFO L448 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2018-12-02 00:48:55,413 INFO L448 ceAbstractionStarter]: For program point L896-2(lines 895 898) no Hoare annotation was computed. [2018-12-02 00:48:55,413 INFO L448 ceAbstractionStarter]: For program point list_delEXIT(lines 895 898) no Hoare annotation was computed. [2018-12-02 00:48:55,413 INFO L444 ceAbstractionStarter]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (let ((.cse0 (< ~guard_malloc_counter~0.offset 1))) (and (or .cse0 (= |old(~elem~0.offset)| ~elem~0.offset)) (or (= |old(~elem~0.base)| ~elem~0.base) .cse0))) [2018-12-02 00:48:55,414 INFO L444 ceAbstractionStarter]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse0 (< ~guard_malloc_counter~0.offset 1))) (and (or (not (= |old(~elem~0.offset)| 0)) .cse0 (< |list_add_#in~new.offset| 2) .cse1) (or (and (= ~elem~0.offset |old(~elem~0.offset)|) .cse1) .cse0 (< |old(~elem~0.offset)| (+ |list_add_#in~new.offset| 1))) (or (= |old(~elem~0.offset)| ~elem~0.offset) .cse0 (< |list_add_#in~new.offset| (+ |old(~elem~0.offset)| 1))))) [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 892) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point L891-2(lines 889 893) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L444 ceAbstractionStarter]: At program point L890-2(line 890) the Hoare annotation is: (let ((.cse0 (< ~guard_malloc_counter~0.offset 1))) (and (or .cse0 (< |list_add_#in~new.offset| (+ |old(~elem~0.offset)| 1))) (or .cse0 (< |old(~elem~0.offset)| (+ |list_add_#in~new.offset| 1))))) [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point L890-3(line 890) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point list_addEXIT(lines 889 893) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L451 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~guard_malloc_counter~0.offset) (= 0 ~elem~0.offset)) [2018-12-02 00:48:55,414 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 00:48:55,414 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) (not (= |old(~elem~0.offset)| 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-12-02 00:48:55,414 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 902 917) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L444 ceAbstractionStarter]: At program point L909(line 909) the Hoare annotation is: (let ((.cse0 (<= 1 ~guard_malloc_counter~0.offset)) (.cse1 (<= 2 main_~dev2~0.offset))) (or (not (= |old(~elem~0.offset)| 0)) (and (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) .cse0 .cse1 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset)) (and .cse0 .cse1 (<= ~elem~0.offset 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 902 917) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L444 ceAbstractionStarter]: At program point L908(line 908) the Hoare annotation is: (let ((.cse0 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (.cse1 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (.cse2 (<= 1 ~guard_malloc_counter~0.offset)) (.cse3 (<= 2 main_~dev2~0.offset))) (or (not (= |old(~elem~0.offset)| 0)) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset)) (and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base) .cse0 .cse1 .cse2 .cse3) (and .cse2 .cse3 (<= ~elem~0.offset 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-12-02 00:48:55,415 INFO L444 ceAbstractionStarter]: At program point L907(line 907) the Hoare annotation is: (or (not (= |old(~elem~0.offset)| 0)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (= ~elem~0.offset |old(~elem~0.offset)|)) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L444 ceAbstractionStarter]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse1 (+ main_~dev1~0.offset 1)) (.cse0 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset))) (or (not (= |old(~elem~0.offset)| 0)) (and (= ~elem~0.offset main_~dev2~0.offset) (= main_~dev2~0.base ~elem~0.base) .cse0 (<= .cse1 ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset) (<= 2 main_~dev2~0.offset)) (and (<= 1 main_~dev1~0.offset) (<= .cse1 main_~dev2~0.offset) .cse0 (= 0 ~elem~0.offset)) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-12-02 00:48:55,415 INFO L444 ceAbstractionStarter]: At program point L905(line 905) the Hoare annotation is: (or (not (= |old(~elem~0.offset)| 0)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base)) (and (= main_~dev1~0.base 0) (= 0 main_~dev1~0.offset) (<= 1 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L444 ceAbstractionStarter]: At program point L904(line 904) the Hoare annotation is: (or (and (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) (not (= |old(~elem~0.offset)| 0)) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point L905-1(line 905) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point L904-1(line 904) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L444 ceAbstractionStarter]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (or (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (or (not (= ~elem~0.offset 0)) (or (< |old(~guard_malloc_counter~0.offset)| 0) (not (= 8 |__getMemory_#in~size|))))) [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point __getMemoryEXIT(lines 869 876) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point __getMemoryFINAL(lines 869 876) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2018-12-02 00:48:55,415 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-12-02 00:48:55,416 INFO L444 ceAbstractionStarter]: At program point L871-2(line 871) the Hoare annotation is: (or (not (= ~elem~0.offset 0)) (or (< |old(~guard_malloc_counter~0.offset)| 0) (not (= 8 |__getMemory_#in~size|)))) [2018-12-02 00:48:55,416 INFO L448 ceAbstractionStarter]: For program point L871-3(line 871) no Hoare annotation was computed. [2018-12-02 00:48:55,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:48:55 BoogieIcfgContainer [2018-12-02 00:48:55,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 00:48:55,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:48:55,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:48:55,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:48:55,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:48:50" (3/4) ... [2018-12-02 00:48:55,420 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 00:48:55,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_malloc [2018-12-02 00:48:55,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 00:48:55,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2018-12-02 00:48:55,424 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2018-12-02 00:48:55,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-12-02 00:48:55,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 00:48:55,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __getMemory [2018-12-02 00:48:55,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-02 00:48:55,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-02 00:48:55,428 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 00:48:55,454 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b076bf5b-6cce-40d2-8fd9-43e88e2bf9af/bin-2019/uautomizer/witness.graphml [2018-12-02 00:48:55,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:48:55,455 INFO L168 Benchmark]: Toolchain (without parser) took 5935.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 950.6 MB in the beginning and 841.6 MB in the end (delta: 109.0 MB). Peak memory consumption was 280.0 MB. Max. memory is 11.5 GB. [2018-12-02 00:48:55,456 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:48:55,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-12-02 00:48:55,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 00:48:55,457 INFO L168 Benchmark]: Boogie Preprocessor took 17.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:48:55,457 INFO L168 Benchmark]: RCFGBuilder took 190.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-12-02 00:48:55,457 INFO L168 Benchmark]: TraceAbstraction took 5387.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 848.0 MB in the end (delta: 212.3 MB). Peak memory consumption was 284.7 MB. Max. memory is 11.5 GB. [2018-12-02 00:48:55,457 INFO L168 Benchmark]: Witness Printer took 37.13 ms. Allocated memory is still 1.2 GB. Free memory was 848.0 MB in the beginning and 841.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-12-02 00:48:55,459 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 190.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5387.88 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 848.0 MB in the end (delta: 212.3 MB). Peak memory consumption was 284.7 MB. Max. memory is 11.5 GB. * Witness Printer took 37.13 ms. Allocated memory is still 1.2 GB. Free memory was 848.0 MB in the beginning and 841.6 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 47 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 473 SDslu, 1273 SDs, 0 SdLazy, 4200 SolverSat, 488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 272 SyntacticMatches, 11 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, 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, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 71 PreInvPairs, 82 NumberOfFragments, 462 HoareAnnotationTreeSize, 71 FomulaSimplifications, 659 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 1704 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 109006 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1699 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 136/211 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...