./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_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan --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 Taipan --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-09 11:41:48,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:41:48,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:41:48,094 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:41:48,094 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:41:48,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:41:48,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:41:48,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:41:48,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:41:48,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:41:48,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:41:48,098 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:41:48,099 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:41:48,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:41:48,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:41:48,100 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:41:48,101 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:41:48,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:41:48,102 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:41:48,103 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:41:48,104 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:41:48,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:41:48,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:41:48,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:41:48,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:41:48,106 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:41:48,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:41:48,107 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:41:48,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:41:48,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:41:48,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:41:48,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:41:48,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:41:48,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:41:48,109 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:41:48,110 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:41:48,110 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 11:41:48,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:41:48,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:41:48,118 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:41:48,118 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:41:48,118 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 11:41:48,118 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 11:41:48,118 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 11:41:48,118 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 11:41:48,118 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 11:41:48,118 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 11:41:48,118 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 11:41:48,118 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 11:41:48,119 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 11:41:48,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:41:48,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:41:48,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:41:48,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:41:48,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:41:48,119 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:41:48,119 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:41:48,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:41:48,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:41:48,120 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:41:48,121 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:41:48,121 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 11:41:48,121 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:41:48,121 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:41:48,121 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 11:41:48,121 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan 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 -> Taipan 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-09 11:41:48,139 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:41:48,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:41:48,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:41:48,152 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:41:48,152 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:41:48,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-12-09 11:41:48,194 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/data/6dac0dd8b/9edf2647ab0c403191995cc06abd62a3/FLAGa7c1808d9 [2018-12-09 11:41:48,640 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:41:48,641 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-12-09 11:41:48,646 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/data/6dac0dd8b/9edf2647ab0c403191995cc06abd62a3/FLAGa7c1808d9 [2018-12-09 11:41:48,654 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/data/6dac0dd8b/9edf2647ab0c403191995cc06abd62a3 [2018-12-09 11:41:48,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:41:48,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:41:48,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:41:48,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:41:48,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:41:48,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b3820ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48, skipping insertion in model container [2018-12-09 11:41:48,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:41:48,690 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:41:48,847 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:41:48,850 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:41:48,905 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:41:48,933 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:41:48,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48 WrapperNode [2018-12-09 11:41:48,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:41:48,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:41:48,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:41:48,934 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:41:48,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:41:48,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:41:48,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:41:48,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:41:48,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... [2018-12-09 11:41:48,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:41:48,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:41:48,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:41:48,967 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:41:48,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:41:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:41:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2018-12-09 11:41:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2018-12-09 11:41:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:41:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:41:49,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:41:49,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:41:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-12-09 11:41:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-12-09 11:41:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 11:41:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-12-09 11:41:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-12-09 11:41:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-12-09 11:41:49,006 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-12-09 11:41:49,006 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2018-12-09 11:41:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2018-12-09 11:41:49,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:41:49,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:41:49,195 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:41:49,196 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 11:41:49,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:41:49 BoogieIcfgContainer [2018-12-09 11:41:49,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:41:49,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:41:49,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:41:49,200 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:41:49,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:41:48" (1/3) ... [2018-12-09 11:41:49,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61921adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:41:49, skipping insertion in model container [2018-12-09 11:41:49,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:41:48" (2/3) ... [2018-12-09 11:41:49,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61921adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:41:49, skipping insertion in model container [2018-12-09 11:41:49,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:41:49" (3/3) ... [2018-12-09 11:41:49,202 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_true-unreach-call.i [2018-12-09 11:41:49,209 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:41:49,215 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 11:41:49,226 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 11:41:49,245 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:41:49,245 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:41:49,245 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:41:49,245 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:41:49,245 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:41:49,245 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:41:49,245 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:41:49,245 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:41:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-09 11:41:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 11:41:49,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:49,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:41:49,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:49,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:49,266 INFO L82 PathProgramCache]: Analyzing trace with hash 713355486, now seen corresponding path program 1 times [2018-12-09 11:41:49,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:49,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:49,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:49,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:41:49,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:41:49,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:41:49,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:41:49,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:41:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:41:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:41:49,423 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 6 states. [2018-12-09 11:41:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:41:49,489 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-12-09 11:41:49,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:41:49,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-09 11:41:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:41:49,498 INFO L225 Difference]: With dead ends: 84 [2018-12-09 11:41:49,498 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 11:41:49,501 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-09 11:41:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 11:41:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 11:41:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 11:41:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-12-09 11:41:49,526 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2018-12-09 11:41:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:41:49,526 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-12-09 11:41:49,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:41:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-12-09 11:41:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 11:41:49,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:49,527 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-09 11:41:49,527 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:49,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1315059296, now seen corresponding path program 1 times [2018-12-09 11:41:49,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:49,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:49,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:49,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:49,608 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-09 11:41:49,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:41:49,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:41:49,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:41:49,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:41:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:41:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:41:49,610 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-12-09 11:41:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:41:49,625 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-12-09 11:41:49,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:41:49,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-12-09 11:41:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:41:49,627 INFO L225 Difference]: With dead ends: 63 [2018-12-09 11:41:49,627 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 11:41:49,628 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-09 11:41:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 11:41:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 11:41:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 11:41:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 11:41:49,633 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 38 [2018-12-09 11:41:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:41:49,633 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 11:41:49,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:41:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 11:41:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 11:41:49,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:49,634 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-09 11:41:49,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:49,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:49,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1021656289, now seen corresponding path program 1 times [2018-12-09 11:41:49,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:49,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:49,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:49,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:49,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:49,710 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-09 11:41:49,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:41:49,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:41:49,711 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-09 11:41:49,712 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [19], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79] [2018-12-09 11:41:49,735 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:41:49,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:41:49,897 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:41:49,898 INFO L272 AbstractInterpreter]: Visited 27 different actions 73 times. Merged at 9 different actions 23 times. Never widened. Performed 518 root evaluator evaluations with a maximum evaluation depth of 3. Performed 518 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 32 variables. [2018-12-09 11:41:49,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:49,906 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:41:49,984 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 60.5% of their original sizes. [2018-12-09 11:41:49,984 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:41:50,274 INFO L418 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-12-09 11:41:50,274 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:41:50,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:41:50,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [7] total 31 [2018-12-09 11:41:50,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:41:50,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 11:41:50,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 11:41:50,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-12-09 11:41:50,276 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 26 states. [2018-12-09 11:41:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:41:51,572 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-12-09 11:41:51,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 11:41:51,572 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-12-09 11:41:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:41:51,574 INFO L225 Difference]: With dead ends: 85 [2018-12-09 11:41:51,574 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 11:41:51,574 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 11:41:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 11:41:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-12-09 11:41:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 11:41:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-12-09 11:41:51,580 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 38 [2018-12-09 11:41:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:41:51,580 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-12-09 11:41:51,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 11:41:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-12-09 11:41:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 11:41:51,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:51,581 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:41:51,582 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:51,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash -579660525, now seen corresponding path program 1 times [2018-12-09 11:41:51,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:51,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:51,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:41:51,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:41:51,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:41:51,635 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-09 11:41:51,636 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81] [2018-12-09 11:41:51,637 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:41:51,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:41:51,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 11:41:51,674 INFO L272 AbstractInterpreter]: Visited 35 different actions 85 times. Merged at 9 different actions 21 times. Never widened. Performed 599 root evaluator evaluations with a maximum evaluation depth of 6. Performed 599 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-09 11:41:51,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:51,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 11:41:51,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:41:51,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:41:51,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:51,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:41:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:51,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:41:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:41:51,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:41:52,423 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-09 11:41:52,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:41:52,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20, 22] total 41 [2018-12-09 11:41:52,438 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:41:52,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 11:41:52,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 11:41:52,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1505, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 11:41:52,439 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 25 states. [2018-12-09 11:41:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:41:52,908 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-12-09 11:41:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 11:41:52,909 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2018-12-09 11:41:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:41:52,909 INFO L225 Difference]: With dead ends: 100 [2018-12-09 11:41:52,909 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 11:41:52,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=2666, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 11:41:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 11:41:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 11:41:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 11:41:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-12-09 11:41:52,918 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 45 [2018-12-09 11:41:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:41:52,919 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-12-09 11:41:52,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 11:41:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-12-09 11:41:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 11:41:52,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:52,920 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-09 11:41:52,920 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:52,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:52,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1531629844, now seen corresponding path program 1 times [2018-12-09 11:41:52,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:52,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:53,068 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-09 11:41:53,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:41:53,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:41:53,068 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-09 11:41:53,068 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [53], [56], [61], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81] [2018-12-09 11:41:53,069 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:41:53,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:41:53,093 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:41:53,093 INFO L272 AbstractInterpreter]: Visited 32 different actions 48 times. Never merged. Never widened. Performed 366 root evaluator evaluations with a maximum evaluation depth of 4. Performed 366 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-09 11:41:53,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:53,094 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:41:53,135 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 62.91% of their original sizes. [2018-12-09 11:41:53,135 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:41:53,373 INFO L418 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-12-09 11:41:53,373 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:41:53,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:41:53,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [19] total 47 [2018-12-09 11:41:53,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:41:53,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 11:41:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 11:41:53,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-12-09 11:41:53,374 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 30 states. [2018-12-09 11:41:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:41:54,595 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-12-09 11:41:54,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 11:41:54,595 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 45 [2018-12-09 11:41:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:41:54,596 INFO L225 Difference]: With dead ends: 92 [2018-12-09 11:41:54,596 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 11:41:54,596 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=2004, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 11:41:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 11:41:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-12-09 11:41:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 11:41:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-12-09 11:41:54,601 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 45 [2018-12-09 11:41:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:41:54,601 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-09 11:41:54,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 11:41:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-12-09 11:41:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 11:41:54,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:54,602 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-09 11:41:54,602 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:54,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash 722283218, now seen corresponding path program 1 times [2018-12-09 11:41:54,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:54,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:54,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:54,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:54,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:54,703 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-09 11:41:54,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:41:54,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:41:54,704 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-12-09 11:41:54,704 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [27], [29], [30], [36], [38], [40], [43], [53], [56], [61], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81] [2018-12-09 11:41:54,705 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:41:54,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:41:54,719 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:41:54,719 INFO L272 AbstractInterpreter]: Visited 32 different actions 48 times. Never merged. Never widened. Performed 358 root evaluator evaluations with a maximum evaluation depth of 4. Performed 358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-09 11:41:54,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:54,720 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:41:54,745 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 62.91% of their original sizes. [2018-12-09 11:41:54,745 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:41:54,954 INFO L418 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-12-09 11:41:54,954 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:41:54,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:41:54,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [14] total 41 [2018-12-09 11:41:54,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:41:54,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 11:41:54,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 11:41:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-12-09 11:41:54,955 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 29 states. [2018-12-09 11:41:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:41:55,970 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-09 11:41:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 11:41:55,970 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2018-12-09 11:41:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:41:55,971 INFO L225 Difference]: With dead ends: 70 [2018-12-09 11:41:55,971 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 11:41:55,971 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=1786, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 11:41:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 11:41:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-09 11:41:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 11:41:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-12-09 11:41:55,976 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 45 [2018-12-09 11:41:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:41:55,976 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-12-09 11:41:55,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 11:41:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-12-09 11:41:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 11:41:55,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:55,977 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-09 11:41:55,977 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:55,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1421196377, now seen corresponding path program 1 times [2018-12-09 11:41:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:55,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:55,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:56,114 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-09 11:41:56,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:41:56,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:41:56,114 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-09 11:41:56,114 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [53], [56], [61], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-12-09 11:41:56,115 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:41:56,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:41:56,131 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:41:56,131 INFO L272 AbstractInterpreter]: Visited 36 different actions 52 times. Never merged. Never widened. Performed 405 root evaluator evaluations with a maximum evaluation depth of 4. Performed 405 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-09 11:41:56,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:56,132 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:41:56,161 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 64.39% of their original sizes. [2018-12-09 11:41:56,161 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:41:56,508 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-09 11:41:56,508 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:41:56,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:41:56,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [17] total 50 [2018-12-09 11:41:56,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:41:56,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-09 11:41:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-09 11:41:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 11:41:56,510 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 35 states. [2018-12-09 11:41:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:41:57,769 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-12-09 11:41:57,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 11:41:57,769 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2018-12-09 11:41:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:41:57,770 INFO L225 Difference]: With dead ends: 99 [2018-12-09 11:41:57,770 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 11:41:57,770 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=2577, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 11:41:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 11:41:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2018-12-09 11:41:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 11:41:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-09 11:41:57,776 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 57 [2018-12-09 11:41:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:41:57,776 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-09 11:41:57,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-09 11:41:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-09 11:41:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 11:41:57,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:57,777 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-09 11:41:57,777 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:57,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2064424293, now seen corresponding path program 1 times [2018-12-09 11:41:57,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:57,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:57,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:57,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:57,929 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-09 11:41:57,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:41:57,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:41:57,929 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-09 11:41:57,929 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [53], [56], [61], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-12-09 11:41:57,930 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:41:57,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:41:57,948 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:41:57,948 INFO L272 AbstractInterpreter]: Visited 39 different actions 61 times. Never merged. Never widened. Performed 461 root evaluator evaluations with a maximum evaluation depth of 4. Performed 461 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 33 variables. [2018-12-09 11:41:57,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:57,950 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:41:57,977 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 65.55% of their original sizes. [2018-12-09 11:41:57,977 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:41:58,440 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-09 11:41:58,440 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:41:58,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:41:58,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [20] total 55 [2018-12-09 11:41:58,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:41:58,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-09 11:41:58,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-09 11:41:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 11:41:58,441 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 37 states. [2018-12-09 11:41:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:41:59,812 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-12-09 11:41:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-09 11:41:59,812 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2018-12-09 11:41:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:41:59,812 INFO L225 Difference]: With dead ends: 91 [2018-12-09 11:41:59,812 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 11:41:59,813 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=2998, Unknown=0, NotChecked=0, Total=3192 [2018-12-09 11:41:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 11:41:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-12-09 11:41:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 11:41:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-09 11:41:59,818 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 57 [2018-12-09 11:41:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:41:59,818 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-09 11:41:59,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-09 11:41:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-09 11:41:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 11:41:59,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:41:59,819 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-09 11:41:59,819 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:41:59,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2008002391, now seen corresponding path program 1 times [2018-12-09 11:41:59,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:41:59,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:59,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:41:59,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:41:59,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:41:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:41:59,953 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-09 11:41:59,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:41:59,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:41:59,954 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-09 11:41:59,954 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [53], [56], [61], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-12-09 11:41:59,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:41:59,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:41:59,982 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 11:41:59,982 INFO L272 AbstractInterpreter]: Visited 40 different actions 88 times. Merged at 4 different actions 11 times. Never widened. Performed 945 root evaluator evaluations with a maximum evaluation depth of 4. Performed 945 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-12-09 11:41:59,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:41:59,983 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 11:42:00,016 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 65.55% of their original sizes. [2018-12-09 11:42:00,016 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 11:42:00,388 INFO L418 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-12-09 11:42:00,388 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 11:42:00,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 11:42:00,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [17] total 53 [2018-12-09 11:42:00,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:42:00,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-09 11:42:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-09 11:42:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 11:42:00,389 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 38 states. [2018-12-09 11:42:02,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:42:02,321 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-12-09 11:42:02,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 11:42:02,322 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 57 [2018-12-09 11:42:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:42:02,322 INFO L225 Difference]: With dead ends: 79 [2018-12-09 11:42:02,322 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 11:42:02,323 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 79 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=368, Invalid=3292, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 11:42:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 11:42:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-09 11:42:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 11:42:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 57 transitions. [2018-12-09 11:42:02,327 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 57 transitions. Word has length 57 [2018-12-09 11:42:02,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:42:02,327 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 57 transitions. [2018-12-09 11:42:02,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-09 11:42:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 57 transitions. [2018-12-09 11:42:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 11:42:02,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:42:02,327 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-09 11:42:02,328 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:42:02,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:42:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1246775843, now seen corresponding path program 1 times [2018-12-09 11:42:02,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:42:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:42:02,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:42:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:42:02,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:42:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:42:02,473 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-09 11:42:02,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:42:02,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:42:02,473 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-09 11:42:02,473 INFO L205 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [53], [56], [61], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-12-09 11:42:02,474 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:42:02,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:42:02,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 11:42:02,501 INFO L272 AbstractInterpreter]: Visited 42 different actions 101 times. Merged at 5 different actions 14 times. Never widened. Performed 948 root evaluator evaluations with a maximum evaluation depth of 4. Performed 948 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-12-09 11:42:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:42:02,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 11:42:02,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:42:02,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:42:02,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:42:02,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:42:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:42:02,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:42:02,646 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-09 11:42:02,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:42:02,901 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-09 11:42:02,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:42:02,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 26 [2018-12-09 11:42:02,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:42:02,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 11:42:02,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 11:42:02,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-12-09 11:42:02,917 INFO L87 Difference]: Start difference. First operand 58 states and 57 transitions. Second operand 26 states. [2018-12-09 11:42:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:42:03,255 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2018-12-09 11:42:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 11:42:03,255 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-12-09 11:42:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:42:03,255 INFO L225 Difference]: With dead ends: 58 [2018-12-09 11:42:03,255 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 11:42:03,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 92 SyntacticMatches, 21 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 11:42:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 11:42:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 11:42:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 11:42:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 11:42:03,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-12-09 11:42:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:42:03,256 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:42:03,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 11:42:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 11:42:03,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 11:42:03,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 11:42:03,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 11:42:03,535 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2018-12-09 11:42:04,144 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2018-12-09 11:42:04,328 INFO L448 ceAbstractionStarter]: For program point my_mallocFINAL(lines 878 880) no Hoare annotation was computed. [2018-12-09 11:42:04,329 INFO L444 ceAbstractionStarter]: At program point L879(line 879) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~guard_malloc_counter~0.base)|))) (.cse1 (not (= ~elem~0.offset 0))) (.cse2 (not (= ~elem~0.base 0))) (.cse3 (not (= 0 |~#head~0.offset|))) (.cse4 (and (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~guard_malloc_counter~0.base 0) (= my_malloc_~size 8))) (.cse5 (= |~#head~0.base| 0)) (.cse6 (not (= |my_malloc_#in~size| 8)))) (and (or (not (= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse6))) [2018-12-09 11:42:04,329 INFO L448 ceAbstractionStarter]: For program point L879-1(line 879) no Hoare annotation was computed. [2018-12-09 11:42:04,329 INFO L444 ceAbstractionStarter]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (let ((.cse0 (and (= ~guard_malloc_counter~0.base 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))) (.cse1 (not (= 0 |old(~guard_malloc_counter~0.base)|))) (.cse2 (not (= ~elem~0.offset 0))) (.cse3 (not (= ~elem~0.base 0))) (.cse4 (not (= 0 |~#head~0.offset|))) (.cse5 (= |~#head~0.base| 0)) (.cse6 (not (= |my_malloc_#in~size| 8)))) (and (or .cse0 (not (= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse6))) [2018-12-09 11:42:04,329 INFO L448 ceAbstractionStarter]: For program point my_mallocEXIT(lines 878 880) no Hoare annotation was computed. [2018-12-09 11:42:04,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 11:42:04,329 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) [2018-12-09 11:42:04,329 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 11:42:04,329 INFO L448 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2018-12-09 11:42:04,329 INFO L448 ceAbstractionStarter]: For program point L896-2(lines 895 898) no Hoare annotation was computed. [2018-12-09 11:42:04,329 INFO L448 ceAbstractionStarter]: For program point list_delEXIT(lines 895 898) no Hoare annotation was computed. [2018-12-09 11:42:04,329 INFO L444 ceAbstractionStarter]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (let ((.cse3 (= ~elem~0.base 0)) (.cse0 (not (= |old(~elem~0.base)| 0))) (.cse1 (not (= 0 |~#head~0.offset|))) (.cse2 (= |~#head~0.base| 0))) (and (or (not (= 2 ~guard_malloc_counter~0.offset)) (not (= 0 ~guard_malloc_counter~0.base)) (not (= |old(~elem~0.offset)| 0)) .cse0 .cse1 .cse2 (and .cse3 (= ~elem~0.offset 0))) (or (< ~guard_malloc_counter~0.offset 0) (and (= |old(~elem~0.offset)| ~elem~0.offset) .cse3) (or (not (= |list_del_#in~entry.offset| 2)) .cse0 (not (= |list_del_#in~entry.base| 0)) .cse1 .cse2)))) [2018-12-09 11:42:04,329 INFO L444 ceAbstractionStarter]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse7 (< ~guard_malloc_counter~0.offset 0)) (.cse0 (= ~elem~0.base 0)) (.cse1 (not (= |list_add_#in~new.base| 0))) (.cse2 (= |list_add_#in~head.base| 0)) (.cse3 (not (= |old(~elem~0.base)| 0))) (.cse4 (not (= 0 |~#head~0.offset|))) (.cse5 (not (= |list_add_#in~head.offset| 0))) (.cse6 (= |~#head~0.base| 0))) (and (or (and .cse0 (= ~elem~0.offset 0)) .cse1 (not (= 2 ~guard_malloc_counter~0.offset)) .cse2 (not (= 0 ~guard_malloc_counter~0.base)) (not (= |old(~elem~0.offset)| 0)) .cse3 (not (= (mod |list_add_#in~new.offset| 2) 0)) .cse4 .cse5 (= |list_add_#in~new.offset| 0) .cse6) (or (and (= |old(~elem~0.offset)| ~elem~0.offset) .cse0) (or .cse3 .cse4 .cse6) .cse7 (< |list_add_#in~new.offset| (+ |old(~elem~0.offset)| 1))) (or .cse7 (and .cse0 (= ~elem~0.offset 2)) (not (= |old(~elem~0.offset)| 2)) (or .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |list_add_#in~new.offset| 1)) .cse6)))) [2018-12-09 11:42:04,329 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 892) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point L891-2(lines 889 893) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L444 ceAbstractionStarter]: At program point L890-2(line 890) the Hoare annotation is: (let ((.cse6 (< ~guard_malloc_counter~0.offset 0)) (.cse0 (not (= |list_add_#in~new.base| 0))) (.cse1 (= |list_add_#in~head.base| 0)) (.cse2 (not (= |old(~elem~0.base)| 0))) (.cse3 (not (= 0 |~#head~0.offset|))) (.cse4 (not (= |list_add_#in~head.offset| 0))) (.cse5 (= |~#head~0.base| 0))) (and (or .cse0 (not (= 2 ~guard_malloc_counter~0.offset)) .cse1 (not (= 0 ~guard_malloc_counter~0.base)) (not (= |old(~elem~0.offset)| 0)) .cse2 (not (= (mod |list_add_#in~new.offset| 2) 0)) .cse3 .cse4 (= |list_add_#in~new.offset| 0) .cse5) (or (or .cse2 .cse3 .cse5) .cse6 (< |list_add_#in~new.offset| (+ |old(~elem~0.offset)| 1))) (or .cse6 (or .cse0 .cse1 .cse2 (not (= |old(~elem~0.offset)| 2)) .cse3 .cse4 (not (= |list_add_#in~new.offset| 1)) .cse5)))) [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point L890-3(line 890) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point list_addEXIT(lines 889 893) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L451 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~guard_malloc_counter~0.offset 0) (= ~elem~0.base 0) (= ~guard_malloc_counter~0.base 0) (= |~#head~0.offset| 0) (= ~elem~0.offset 0) (not (= |~#head~0.base| 0))) [2018-12-09 11:42:04,330 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (and (= ~elem~0.base 0) (= ~guard_malloc_counter~0.base 0) (= ~elem~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0)) (not (= |old(~elem~0.base)| 0)) (not (= 0 |~#head~0.offset|)) (= |~#head~0.base| 0) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 902 917) no Hoare annotation was computed. [2018-12-09 11:42:04,330 INFO L444 ceAbstractionStarter]: At program point L909(line 909) the Hoare annotation is: (let ((.cse0 (= main_~dev2~0.base 0)) (.cse1 (= ~elem~0.base 0)) (.cse3 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse4 (= main_~dev2~0.offset 2)) (.cse2 (= ~elem~0.offset 0))) (or (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0)) (not (= |old(~elem~0.base)| 0)) (and (= main_~dev1~0.base 0) .cse0 (= (mod main_~dev2~0.offset 2) 0) .cse1 (= ~guard_malloc_counter~0.base 0) (= ~guard_malloc_counter~0.offset 2) (not (= main_~dev2~0.offset 0)) .cse2) (not (= 0 |~#head~0.offset|)) (and (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) .cse0 .cse1 .cse3 .cse4 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset)) (and (= ~elem~0.offset 1) .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse2) (= |~#head~0.base| 0) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-12-09 11:42:04,330 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 902 917) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L444 ceAbstractionStarter]: At program point L908(line 908) the Hoare annotation is: (let ((.cse1 (= main_~dev1~0.base 0)) (.cse2 (= main_~dev2~0.base 0)) (.cse3 (= ~elem~0.base 0)) (.cse0 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse4 (= main_~dev2~0.offset 2))) (or (and .cse0 (and .cse1 (= main_~dev1~0.offset 1) .cse2 .cse3 .cse4 (= ~elem~0.offset 2))) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0)) (not (= |old(~elem~0.base)| 0)) (and .cse1 .cse2 (= (mod main_~dev2~0.offset 2) 0) .cse3 (= ~guard_malloc_counter~0.base 0) (= ~guard_malloc_counter~0.offset 2) (not (= main_~dev2~0.offset 0)) (= ~elem~0.offset 0)) (not (= 0 |~#head~0.offset|)) (and (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) .cse2 .cse3 .cse0 .cse4 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset)) (and (= ~elem~0.offset 1) .cse2 .cse3 .cse0 .cse4) (= |~#head~0.base| 0) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-12-09 11:42:04,331 INFO L444 ceAbstractionStarter]: At program point L907(line 907) the Hoare annotation is: (or (and (= main_~dev1~0.base 0) (= main_~dev1~0.offset 1) (= main_~dev2~0.offset 2) (= ~guard_malloc_counter~0.offset 2) (= main_~dev2~0.base 0) (= ~elem~0.base 0) (= ~guard_malloc_counter~0.base 0) (= ~elem~0.offset 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0)) (not (= |old(~elem~0.base)| 0)) (not (= 0 |~#head~0.offset|)) (= |~#head~0.base| 0) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L444 ceAbstractionStarter]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse0 (= main_~dev1~0.base 0)) (.cse1 (= main_~dev1~0.offset 1)) (.cse3 (= main_~dev2~0.base 0)) (.cse4 (= ~elem~0.base 0)) (.cse2 (= main_~dev2~0.offset 2))) (or (and .cse0 .cse1 .cse2 (= ~guard_malloc_counter~0.offset 2) .cse3 .cse4 (= ~guard_malloc_counter~0.base 0) (= ~elem~0.offset 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0)) (and .cse0 .cse1 .cse3 .cse4 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) .cse2 (= ~elem~0.offset 2)) (not (= |old(~elem~0.base)| 0)) (not (= 0 |~#head~0.offset|)) (= |~#head~0.base| 0) (not (= 0 |old(~guard_malloc_counter~0.offset)|)))) [2018-12-09 11:42:04,331 INFO L444 ceAbstractionStarter]: At program point L905(line 905) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0)) (let ((.cse0 (= ~guard_malloc_counter~0.offset 1)) (.cse1 (= main_~dev1~0.base 0)) (.cse2 (= ~elem~0.base 0)) (.cse3 (= ~guard_malloc_counter~0.base 0)) (.cse4 (= ~elem~0.offset 0))) (or (and .cse0 .cse1 (= main_~dev1~0.offset 1) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= main_~dev1~0.offset 0) .cse3 .cse4))) (not (= |old(~elem~0.base)| 0)) (not (= 0 |~#head~0.offset|)) (= |~#head~0.base| 0) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L444 ceAbstractionStarter]: At program point L904(line 904) the Hoare annotation is: (or (and (= ~elem~0.base 0) (= ~guard_malloc_counter~0.base 0) (= ~elem~0.offset 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0)) (not (= |old(~elem~0.base)| 0)) (not (= 0 |~#head~0.offset|)) (= |~#head~0.base| 0) (not (= 0 |old(~guard_malloc_counter~0.offset)|))) [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point L905-1(line 905) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point L904-1(line 904) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L444 ceAbstractionStarter]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~guard_malloc_counter~0.base)|))) (.cse1 (not (= |__getMemory_#in~size| 8))) (.cse2 (not (= ~elem~0.offset 0))) (.cse3 (not (= ~elem~0.base 0))) (.cse5 (not (= 0 |~#head~0.offset|))) (.cse4 (and (= ~guard_malloc_counter~0.base 0) (= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset))) (.cse6 (= |~#head~0.base| 0))) (and (or (not (= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 (not (= 0 |old(~guard_malloc_counter~0.offset)|))))) [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point __getMemoryEXIT(lines 869 876) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point __getMemoryFINAL(lines 869 876) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-12-09 11:42:04,331 INFO L444 ceAbstractionStarter]: At program point L871-2(line 871) the Hoare annotation is: (let ((.cse0 (not (= 0 |old(~guard_malloc_counter~0.base)|))) (.cse1 (not (= |__getMemory_#in~size| 8))) (.cse2 (not (= ~elem~0.offset 0))) (.cse3 (not (= ~elem~0.base 0))) (.cse4 (not (= 0 |~#head~0.offset|))) (.cse5 (= |~#head~0.base| 0))) (and (or (not (= 1 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 0 |old(~guard_malloc_counter~0.offset)|))))) [2018-12-09 11:42:04,331 INFO L448 ceAbstractionStarter]: For program point L871-3(line 871) no Hoare annotation was computed. [2018-12-09 11:42:04,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:42:04 BoogieIcfgContainer [2018-12-09 11:42:04,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:42:04,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:42:04,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:42:04,333 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:42:04,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:41:49" (3/4) ... [2018-12-09 11:42:04,335 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 11:42:04,339 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_malloc [2018-12-09 11:42:04,339 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 11:42:04,339 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2018-12-09 11:42:04,339 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2018-12-09 11:42:04,339 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-12-09 11:42:04,339 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 11:42:04,339 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __getMemory [2018-12-09 11:42:04,342 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-09 11:42:04,342 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 11:42:04,342 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 11:42:04,369 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_619ac8a1-998b-407b-919d-0c9f2796ecbf/bin-2019/utaipan/witness.graphml [2018-12-09 11:42:04,369 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:42:04,369 INFO L168 Benchmark]: Toolchain (without parser) took 15713.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 499.6 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -103.9 MB). Peak memory consumption was 395.8 MB. Max. memory is 11.5 GB. [2018-12-09 11:42:04,370 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:42:04,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2018-12-09 11:42:04,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 11:42:04,370 INFO L168 Benchmark]: Boogie Preprocessor took 13.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:42:04,370 INFO L168 Benchmark]: RCFGBuilder took 229.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-09 11:42:04,371 INFO L168 Benchmark]: TraceAbstraction took 15136.23 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 362.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.4 MB). Peak memory consumption was 402.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:42:04,371 INFO L168 Benchmark]: Witness Printer took 35.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:42:04,372 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 229.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15136.23 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 362.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.4 MB). Peak memory consumption was 402.7 MB. Max. memory is 11.5 GB. * Witness Printer took 35.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. 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, 15.0s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 365 SDtfs, 530 SDslu, 2705 SDs, 0 SdLazy, 3074 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 686 GetRequests, 263 SyntacticMatches, 26 SemanticMatches, 397 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4768 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 8 AbstIntIterations, 6 AbstIntStrong, 0.9380249333431961 AbsIntWeakeningRatio, 1.3651877133105803 AbsIntAvgWeakeningVarsNumRemoved, 10.378839590443686 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 80 PreInvPairs, 94 NumberOfFragments, 1090 HoareAnnotationTreeSize, 80 FomulaSimplifications, 2921 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 3410 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 554 NumberOfCodeBlocks, 554 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 642 ConstructedInterpolants, 0 QuantifiedInterpolants, 102826 SizeOfPredicates, 15 NumberOfNonLiveVariables, 575 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 138/213 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...