./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/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_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/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-1dbac8b [2018-11-10 11:55:22,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:55:22,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:55:22,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:55:22,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:55:22,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:55:22,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:55:22,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:55:22,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:55:22,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:55:22,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:55:22,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:55:22,233 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:55:22,234 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:55:22,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:55:22,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:55:22,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:55:22,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:55:22,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:55:22,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:55:22,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:55:22,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:55:22,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:55:22,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:55:22,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:55:22,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:55:22,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:55:22,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:55:22,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:55:22,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:55:22,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:55:22,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:55:22,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:55:22,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:55:22,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:55:22,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:55:22,248 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:55:22,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:55:22,258 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:55:22,259 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:55:22,259 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:55:22,259 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:55:22,259 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:55:22,259 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:55:22,260 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:55:22,260 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:55:22,260 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:55:22,260 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:55:22,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:55:22,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:55:22,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:55:22,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:55:22,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:55:22,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:55:22,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:55:22,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:55:22,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:55:22,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:55:22,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:55:22,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:55:22,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:55:22,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:55:22,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:55:22,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:55:22,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:55:22,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:55:22,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:55:22,263 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:55:22,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:55:22,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:55:22,264 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:55:22,264 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_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/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-11-10 11:55:22,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:55:22,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:55:22,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:55:22,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:55:22,297 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:55:22,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-11-10 11:55:22,331 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/data/6fab8fba5/8e9a28dffb2e4c188f1925997df310ae/FLAG310c9b730 [2018-11-10 11:55:22,654 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:55:22,655 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-11-10 11:55:22,661 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/data/6fab8fba5/8e9a28dffb2e4c188f1925997df310ae/FLAG310c9b730 [2018-11-10 11:55:22,672 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/data/6fab8fba5/8e9a28dffb2e4c188f1925997df310ae [2018-11-10 11:55:22,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:55:22,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:55:22,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:55:22,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:55:22,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:55:22,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:22,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa5b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22, skipping insertion in model container [2018-11-10 11:55:22,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:22,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:55:22,710 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:55:22,888 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:55:22,891 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:55:22,916 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:55:22,955 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:55:22,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22 WrapperNode [2018-11-10 11:55:22,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:55:22,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:55:22,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:55:22,956 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:55:23,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:55:23,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:55:23,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:55:23,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:55:23,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... [2018-11-10 11:55:23,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:55:23,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:55:23,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:55:23,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:55:23,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/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-11-10 11:55:23,087 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2018-11-10 11:55:23,087 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2018-11-10 11:55:23,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:55:23,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:55:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:55:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:55:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-10 11:55:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-10 11:55:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-10 11:55:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-10 11:55:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-11-10 11:55:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-11-10 11:55:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2018-11-10 11:55:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2018-11-10 11:55:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:55:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:55:23,360 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:55:23,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:23 BoogieIcfgContainer [2018-11-10 11:55:23,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:55:23,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:55:23,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:55:23,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:55:23,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:55:22" (1/3) ... [2018-11-10 11:55:23,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644cc4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:55:23, skipping insertion in model container [2018-11-10 11:55:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:22" (2/3) ... [2018-11-10 11:55:23,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644cc4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:55:23, skipping insertion in model container [2018-11-10 11:55:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:23" (3/3) ... [2018-11-10 11:55:23,367 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_true-unreach-call.i [2018-11-10 11:55:23,372 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:55:23,377 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:55:23,389 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:55:23,415 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:55:23,415 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:55:23,416 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:55:23,416 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:55:23,416 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:55:23,416 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:55:23,416 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:55:23,416 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:55:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-10 11:55:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 11:55:23,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:23,436 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:55:23,438 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:23,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash 713355486, now seen corresponding path program 1 times [2018-11-10 11:55:23,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:23,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:23,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:23,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:23,487 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:55:23,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:55:23,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:55:23,614 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:23,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:55:23,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:55:23,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:55:23,626 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 6 states. [2018-11-10 11:55:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:23,711 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-10 11:55:23,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:55:23,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-10 11:55:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:23,718 INFO L225 Difference]: With dead ends: 84 [2018-11-10 11:55:23,719 INFO L226 Difference]: Without dead ends: 39 [2018-11-10 11:55:23,721 INFO L605 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-11-10 11:55:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-10 11:55:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-10 11:55:23,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 11:55:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-10 11:55:23,748 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2018-11-10 11:55:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:23,748 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-10 11:55:23,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:55:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-10 11:55:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 11:55:23,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:23,750 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:55:23,750 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:23,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:23,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1315059296, now seen corresponding path program 1 times [2018-11-10 11:55:23,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:23,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:23,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:23,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:23,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:55:23,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:55:23,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:55:23,859 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:23,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 11:55:23,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:55:23,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:55:23,860 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-11-10 11:55:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:23,879 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-10 11:55:23,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:55:23,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-11-10 11:55:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:23,881 INFO L225 Difference]: With dead ends: 63 [2018-11-10 11:55:23,881 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 11:55:23,882 INFO L605 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-11-10 11:55:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 11:55:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 11:55:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 11:55:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-10 11:55:23,889 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 38 [2018-11-10 11:55:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:23,890 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-10 11:55:23,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 11:55:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-10 11:55:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 11:55:23,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:23,891 INFO L375 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-11-10 11:55:23,891 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:23,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1021656289, now seen corresponding path program 1 times [2018-11-10 11:55:23,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:23,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:23,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:55:23,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:55:23,982 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:55:23,982 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-10 11:55:23,984 INFO L202 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-11-10 11:55:24,019 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:55:24,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:55:24,420 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:55:24,421 INFO L272 AbstractInterpreter]: Visited 27 different actions 73 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:55:24,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:24,442 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:55:24,832 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 59.62% of their original sizes. [2018-11-10 11:55:24,832 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:55:26,759 INFO L415 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-11-10 11:55:26,760 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:55:26,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:55:26,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [7] total 32 [2018-11-10 11:55:26,761 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:26,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 11:55:26,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 11:55:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-11-10 11:55:26,762 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 27 states. [2018-11-10 11:55:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:32,420 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-10 11:55:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 11:55:32,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2018-11-10 11:55:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:32,422 INFO L225 Difference]: With dead ends: 70 [2018-11-10 11:55:32,422 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 11:55:32,423 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2018-11-10 11:55:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 11:55:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-11-10 11:55:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 11:55:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-10 11:55:32,435 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 38 [2018-11-10 11:55:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:32,435 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-10 11:55:32,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 11:55:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-10 11:55:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:55:32,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:32,436 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:55:32,437 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:32,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -579660525, now seen corresponding path program 1 times [2018-11-10 11:55:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:32,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:32,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:55:32,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:55:32,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:55:32,495 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 11:55:32,495 INFO L202 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-11-10 11:55:32,497 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:55:32,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:55:32,642 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:55:32,642 INFO L272 AbstractInterpreter]: Visited 33 different actions 85 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:55:32,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:32,656 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:55:32,812 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 61.9% of their original sizes. [2018-11-10 11:55:32,812 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:55:35,032 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-10 11:55:35,032 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:55:35,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:55:35,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [7] total 38 [2018-11-10 11:55:35,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:35,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 11:55:35,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 11:55:35,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 11:55:35,034 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 33 states. [2018-11-10 11:55:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:42,624 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-10 11:55:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 11:55:42,624 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2018-11-10 11:55:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:42,626 INFO L225 Difference]: With dead ends: 88 [2018-11-10 11:55:42,626 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 11:55:42,627 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=182, Invalid=2170, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 11:55:42,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 11:55:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-11-10 11:55:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 11:55:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-11-10 11:55:42,639 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 45 [2018-11-10 11:55:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:42,640 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-11-10 11:55:42,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 11:55:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-11-10 11:55:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 11:55:42,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:42,641 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:55:42,641 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:42,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1389007151, now seen corresponding path program 1 times [2018-11-10 11:55:42,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:42,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:42,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 11:55:42,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:55:42,704 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:55:42,704 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-10 11:55:42,705 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [27], [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-11-10 11:55:42,706 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:55:42,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:55:42,810 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:55:42,811 INFO L272 AbstractInterpreter]: Visited 33 different actions 85 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:55:42,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:42,815 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:55:42,960 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 61.9% of their original sizes. [2018-11-10 11:55:42,960 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:55:45,040 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-10 11:55:45,040 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:55:45,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:55:45,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [7] total 37 [2018-11-10 11:55:45,040 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:45,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-10 11:55:45,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-10 11:55:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-11-10 11:55:45,041 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 32 states. [2018-11-10 11:55:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:55:51,161 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-11-10 11:55:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 11:55:51,161 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-11-10 11:55:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:55:51,162 INFO L225 Difference]: With dead ends: 99 [2018-11-10 11:55:51,162 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 11:55:51,163 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=220, Invalid=2036, Unknown=0, NotChecked=0, Total=2256 [2018-11-10 11:55:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 11:55:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2018-11-10 11:55:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 11:55:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-10 11:55:51,177 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 45 [2018-11-10 11:55:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:55:51,177 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-10 11:55:51,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-10 11:55:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-10 11:55:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:55:51,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:55:51,178 INFO L375 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-11-10 11:55:51,178 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:55:51,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:51,179 INFO L82 PathProgramCache]: Analyzing trace with hash 279544102, now seen corresponding path program 1 times [2018-11-10 11:55:51,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:55:51,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:51,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:55:51,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:55:51,180 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:55:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:55:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:55:51,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:55:51,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:55:51,236 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:55:51,236 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [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], [82], [83], [84], [85] [2018-11-10 11:55:51,237 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:55:51,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:55:51,346 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:55:51,346 INFO L272 AbstractInterpreter]: Visited 37 different actions 89 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:55:51,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:55:51,347 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:55:51,503 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 63.19% of their original sizes. [2018-11-10 11:55:51,504 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:55:54,364 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 11:55:54,364 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:55:54,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:55:54,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [7] total 44 [2018-11-10 11:55:54,365 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:55:54,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 11:55:54,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 11:55:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 11:55:54,365 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 39 states. [2018-11-10 11:56:01,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:56:01,866 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-11-10 11:56:01,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-10 11:56:01,866 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 57 [2018-11-10 11:56:01,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:56:01,867 INFO L225 Difference]: With dead ends: 104 [2018-11-10 11:56:01,867 INFO L226 Difference]: Without dead ends: 96 [2018-11-10 11:56:01,868 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=214, Invalid=2978, Unknown=0, NotChecked=0, Total=3192 [2018-11-10 11:56:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-10 11:56:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2018-11-10 11:56:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 11:56:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-10 11:56:01,881 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 57 [2018-11-10 11:56:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:56:01,881 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-10 11:56:01,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 11:56:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-10 11:56:01,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:56:01,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:56:01,882 INFO L375 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-11-10 11:56:01,882 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:56:01,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:01,883 INFO L82 PathProgramCache]: Analyzing trace with hash -529802524, now seen corresponding path program 1 times [2018-11-10 11:56:01,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:56:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:56:01,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:56:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:56:01,884 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:56:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:56:01,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:56:01,958 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:56:01,958 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:56:01,959 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [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], [82], [83], [84], [85] [2018-11-10 11:56:01,960 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:56:01,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:56:02,108 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:56:02,108 INFO L272 AbstractInterpreter]: Visited 40 different actions 98 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-11-10 11:56:02,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:02,112 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:56:02,282 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-11-10 11:56:02,282 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:56:05,394 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 11:56:05,394 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:56:05,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:56:05,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [7] total 46 [2018-11-10 11:56:05,395 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:56:05,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-10 11:56:05,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-10 11:56:05,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1536, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 11:56:05,396 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 41 states. [2018-11-10 11:56:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:56:14,681 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-11-10 11:56:14,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-10 11:56:14,681 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 57 [2018-11-10 11:56:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:56:14,682 INFO L225 Difference]: With dead ends: 96 [2018-11-10 11:56:14,682 INFO L226 Difference]: Without dead ends: 83 [2018-11-10 11:56:14,682 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=229, Invalid=3431, Unknown=0, NotChecked=0, Total=3660 [2018-11-10 11:56:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-10 11:56:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-11-10 11:56:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 11:56:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-10 11:56:14,690 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 57 [2018-11-10 11:56:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:56:14,690 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-10 11:56:14,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-10 11:56:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-10 11:56:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:56:14,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:56:14,691 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2018-11-10 11:56:14,691 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:56:14,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash -307261912, now seen corresponding path program 1 times [2018-11-10 11:56:14,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:56:14,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:56:14,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:56:14,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:56:14,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:56:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:56:14,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:56:14,772 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:56:14,772 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:56:14,772 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [27], [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], [82], [83], [84], [85] [2018-11-10 11:56:14,773 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:56:14,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:56:14,978 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:56:14,978 INFO L272 AbstractInterpreter]: Visited 41 different actions 125 times. Merged at 13 different actions 34 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-11-10 11:56:14,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:14,983 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:56:15,211 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-11-10 11:56:15,211 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:56:18,802 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 11:56:18,803 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:56:18,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:56:18,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [7] total 47 [2018-11-10 11:56:18,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:56:18,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-10 11:56:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 11:56:18,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1525, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 11:56:18,804 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 42 states. [2018-11-10 11:56:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:56:28,832 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-10 11:56:28,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-10 11:56:28,832 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 57 [2018-11-10 11:56:28,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:56:28,832 INFO L225 Difference]: With dead ends: 84 [2018-11-10 11:56:28,832 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 11:56:28,833 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=405, Invalid=3755, Unknown=0, NotChecked=0, Total=4160 [2018-11-10 11:56:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 11:56:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-11-10 11:56:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 11:56:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-10 11:56:28,841 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 57 [2018-11-10 11:56:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:56:28,841 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-10 11:56:28,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-10 11:56:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-10 11:56:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:56:28,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:56:28,842 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1] [2018-11-10 11:56:28,843 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:56:28,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:28,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1347450974, now seen corresponding path program 1 times [2018-11-10 11:56:28,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:56:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:56:28,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:56:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:56:28,845 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:56:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 11:56:28,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:56:28,920 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:56:28,920 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:56:28,920 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [27], [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], [82], [83], [84], [85] [2018-11-10 11:56:28,922 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:56:28,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:56:29,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:56:29,168 INFO L272 AbstractInterpreter]: Visited 43 different actions 149 times. Merged at 14 different actions 40 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-11-10 11:56:29,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:29,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:56:29,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:56:29,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/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-11-10 11:56:29,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:56:29,180 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:56:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:29,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:56:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 11:56:29,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:56:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 11:56:30,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:56:30,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 23] total 42 [2018-11-10 11:56:30,069 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:56:30,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-10 11:56:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 11:56:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 11:56:30,070 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 26 states. [2018-11-10 11:56:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:56:30,745 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-11-10 11:56:30,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 11:56:30,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-10 11:56:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:56:30,747 INFO L225 Difference]: With dead ends: 92 [2018-11-10 11:56:30,747 INFO L226 Difference]: Without dead ends: 58 [2018-11-10 11:56:30,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=3054, Unknown=0, NotChecked=0, Total=3422 [2018-11-10 11:56:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-10 11:56:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-10 11:56:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 11:56:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 57 transitions. [2018-11-10 11:56:30,758 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 57 transitions. Word has length 57 [2018-11-10 11:56:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:56:30,758 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 57 transitions. [2018-11-10 11:56:30,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-10 11:56:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 57 transitions. [2018-11-10 11:56:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 11:56:30,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:56:30,759 INFO L375 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-11-10 11:56:30,759 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:56:30,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1246775843, now seen corresponding path program 1 times [2018-11-10 11:56:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:56:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:56:30,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:56:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:56:30,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:56:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:56:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 11:56:30,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:56:30,926 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:56:30,926 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 11:56:30,926 INFO L202 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-11-10 11:56:30,927 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:56:30,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:56:31,098 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:56:31,099 INFO L272 AbstractInterpreter]: Visited 40 different actions 99 times. Merged at 5 different actions 14 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-11-10 11:56:31,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:56:31,108 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:56:31,310 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-11-10 11:56:31,310 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:56:34,001 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 11:56:34,001 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:56:34,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:56:34,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [20] total 60 [2018-11-10 11:56:34,002 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:56:34,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-10 11:56:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-10 11:56:34,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 11:56:34,003 INFO L87 Difference]: Start difference. First operand 58 states and 57 transitions. Second operand 42 states. [2018-11-10 11:56:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:56:42,442 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2018-11-10 11:56:42,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-10 11:56:42,442 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 57 [2018-11-10 11:56:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:56:42,443 INFO L225 Difference]: With dead ends: 58 [2018-11-10 11:56:42,443 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:56:42,444 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=388, Invalid=3152, Unknown=0, NotChecked=0, Total=3540 [2018-11-10 11:56:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:56:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:56:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:56:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:56:42,445 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-11-10 11:56:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:56:42,445 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:56:42,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-10 11:56:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:56:42,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:56:42,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:56:42,863 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 213 [2018-11-10 11:56:45,442 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 466 DAG size of output: 120 [2018-11-10 11:56:46,158 WARN L179 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 70 [2018-11-10 11:56:46,894 WARN L179 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 379 DAG size of output: 63 [2018-11-10 11:56:47,581 WARN L179 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 56 [2018-11-10 11:56:48,134 WARN L179 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 62 [2018-11-10 11:56:48,263 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 43 [2018-11-10 11:56:48,872 WARN L179 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 61 [2018-11-10 11:56:48,999 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 43 [2018-11-10 11:56:49,662 WARN L179 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 91 [2018-11-10 11:56:49,948 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 45 [2018-11-10 11:56:51,080 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 348 DAG size of output: 94 [2018-11-10 11:56:51,452 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 53 [2018-11-10 11:56:52,211 WARN L179 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 73 [2018-11-10 11:56:52,646 WARN L179 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 53 [2018-11-10 11:56:52,648 INFO L425 ceAbstractionStarter]: For program point my_mallocFINAL(lines 878 880) no Hoare annotation was computed. [2018-11-10 11:56:52,648 INFO L421 ceAbstractionStarter]: At program point L879(line 879) the Hoare annotation is: (let ((.cse4 (+ |~#head~0.offset| 8))) (let ((.cse0 (<= 8 (+ ~guard_malloc_counter~0.base |my_malloc_#in~size|))) (.cse1 (<= my_malloc_~size (+ ~elem~0.base 8))) (.cse2 (<= (+ ~guard_malloc_counter~0.base 8) my_malloc_~size)) (.cse3 (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|)) (.cse5 (< 0 (+ |~#head~0.offset| ~elem~0.base))) (.cse6 (< .cse4 |my_malloc_#in~size|)) (.cse7 (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|))) (.cse8 (< |old(~guard_malloc_counter~0.base)| ~elem~0.offset))) (and (or (and .cse0 .cse1 (<= ~guard_malloc_counter~0.offset ~elem~0.offset) (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset)) .cse2) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< .cse3 0) (< |my_malloc_#in~size| .cse4) .cse5 .cse6 (< (+ |old(~guard_malloc_counter~0.base)| ~elem~0.offset) 0) .cse7 (< ~elem~0.base |old(~guard_malloc_counter~0.offset)|) .cse8) (or (and .cse0 .cse1 (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset (+ ~elem~0.base 1)) .cse2) (< (+ ~elem~0.offset ~elem~0.base) 0) (< |my_malloc_#in~size| (+ |old(~guard_malloc_counter~0.offset)| 7)) (< .cse3 1) .cse5 .cse6 .cse7 .cse8)))) [2018-11-10 11:56:52,648 INFO L425 ceAbstractionStarter]: For program point L879-1(line 879) no Hoare annotation was computed. [2018-11-10 11:56:52,649 INFO L421 ceAbstractionStarter]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (let ((.cse6 (+ |~#head~0.offset| 8))) (let ((.cse0 (<= 0 (* 2 ~guard_malloc_counter~0.base))) (.cse1 (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|)) (.cse2 (< 0 (+ |~#head~0.offset| ~elem~0.base))) (.cse3 (< .cse6 |my_malloc_#in~size|)) (.cse4 (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|))) (.cse5 (< |old(~guard_malloc_counter~0.base)| ~elem~0.offset))) (and (or (and (<= (+ ~elem~0.offset ~guard_malloc_counter~0.base) 0) .cse0 (<= 1 (+ ~elem~0.base ~guard_malloc_counter~0.offset)) (<= ~guard_malloc_counter~0.offset (+ ~elem~0.base 1))) (< (+ ~elem~0.offset ~elem~0.base) 0) (< |my_malloc_#in~size| (+ |old(~guard_malloc_counter~0.offset)| 7)) (< .cse1 1) .cse2 .cse3 .cse4 .cse5) (or (and (<= (+ ~guard_malloc_counter~0.base ~guard_malloc_counter~0.offset) 0) .cse0 (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset))) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< .cse1 0) (< |my_malloc_#in~size| .cse6) .cse2 .cse3 (< (+ |old(~guard_malloc_counter~0.base)| ~elem~0.offset) 0) .cse4 (< ~elem~0.base |old(~guard_malloc_counter~0.offset)|) .cse5)))) [2018-11-10 11:56:52,649 INFO L425 ceAbstractionStarter]: For program point my_mallocEXIT(lines 878 880) no Hoare annotation was computed. [2018-11-10 11:56:52,649 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:56:52,649 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset |old(~elem~0.offset)|)) [2018-11-10 11:56:52,649 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:56:52,649 INFO L425 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2018-11-10 11:56:52,649 INFO L425 ceAbstractionStarter]: For program point L896-2(lines 895 898) no Hoare annotation was computed. [2018-11-10 11:56:52,649 INFO L425 ceAbstractionStarter]: For program point list_delEXIT(lines 895 898) no Hoare annotation was computed. [2018-11-10 11:56:52,649 INFO L421 ceAbstractionStarter]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (let ((.cse7 (+ ~elem~0.base |list_del_#in~entry.base|))) (let ((.cse1 (* 2 |old(~elem~0.offset)|)) (.cse3 (* 2 ~elem~0.offset)) (.cse4 (<= .cse7 0)) (.cse2 (not (= (mod |list_del_#in~entry.offset| 2) 0))) (.cse6 (+ |old(~elem~0.offset)| |old(~elem~0.base)|)) (.cse5 (< |~#head~0.offset| |list_del_#in~entry.base|)) (.cse0 (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)))) (and (or (and (<= 0 (* 2 ~elem~0.base)) (= ~elem~0.offset 0) (<= (+ |~#head~0.offset| ~elem~0.base) 0)) (< |old(~elem~0.base)| |old(~elem~0.offset)|) .cse0 (< (+ |~#head~0.offset| |old(~elem~0.offset)|) 0) (< .cse1 0) (< 0 .cse1)) (or .cse2 (and (<= ~elem~0.offset (+ ~elem~0.base 1)) (<= 2 .cse3) .cse4) (< .cse1 2) (< (+ |list_del_#in~entry.base| 1) |old(~elem~0.offset)|) .cse5 (< .cse6 1) (< |list_del_#in~entry.offset| |old(~elem~0.offset)|) (< 3 (+ |list_del_#in~entry.offset| |old(~elem~0.offset)|)) .cse0) (or (and (= (mod ~elem~0.offset 2) 0) (and (<= 0 .cse7) (<= 0 .cse3) (<= ~elem~0.offset (+ ~elem~0.base 2)) .cse4)) (or .cse2 (< .cse6 0) (< (+ |list_del_#in~entry.base| 2) |old(~elem~0.offset)|) (< 2 (+ |list_del_#in~entry.offset| |~#head~0.offset|)) (< 0 (* 2 |~#head~0.offset|)) (< (+ |~#head~0.offset| |list_del_#in~entry.base|) 0) (< (+ |old(~elem~0.base)| |list_del_#in~entry.base|) 0) .cse5 (< (+ |list_del_#in~entry.offset| |list_del_#in~entry.base|) 1) .cse0) (not (= (mod |old(~elem~0.offset)| 2) 0)))))) [2018-11-10 11:56:52,650 INFO L421 ceAbstractionStarter]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse23 (* 2 ~elem~0.offset)) (.cse21 (+ ~elem~0.offset ~elem~0.base)) (.cse22 (+ |old(~elem~0.offset)| |old(~elem~0.base)|))) (let ((.cse2 (< ~guard_malloc_counter~0.offset 0)) (.cse11 (<= ~elem~0.base |list_add_#in~new.base|)) (.cse14 (< 1 (+ |old(~elem~0.offset)| |list_add_#in~new.base|))) (.cse13 (not (= (mod |list_add_#in~new.offset| 2) 0))) (.cse5 (< .cse22 0)) (.cse16 (< (+ |list_add_#in~new.base| 2) |list_add_#in~new.offset|)) (.cse8 (< 0 (* 2 |list_add_#in~new.base|))) (.cse0 (<= .cse21 0)) (.cse1 (<= 0 .cse23)) (.cse3 (< |list_add_#in~head.base| |~#head~0.base|)) (.cse4 (< |~#head~0.base| |list_add_#in~head.base|)) (.cse18 (+ |list_add_#in~head.offset| |old(~elem~0.offset)|)) (.cse12 (<= 2 .cse23)) (.cse20 (+ ~elem~0.base 2)) (.cse17 (< |old(~elem~0.base)| |~#head~0.offset|)) (.cse15 (< .cse22 1)) (.cse7 (< (+ |list_add_#in~head.offset| |list_add_#in~new.base|) 0)) (.cse9 (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|))) (.cse19 (< |~#head~0.offset| |list_add_#in~new.base|)) (.cse10 (not (= |list_add_#in~new.offset| 1))) (.cse6 (< (+ |~#head~0.offset| 1) |list_add_#in~new.offset|))) (and (or (and (<= 0 (+ |list_add_#in~head.offset| ~elem~0.base)) .cse0 .cse1) .cse2 (or .cse3 (not (= |old(~elem~0.offset)| 0)) .cse4 .cse5 .cse6) .cse7 (< 1 (+ |list_add_#in~new.offset| |list_add_#in~head.offset|)) .cse8 .cse9 .cse10) (or (and .cse11 (<= ~elem~0.offset (+ ~elem~0.base 1)) .cse12) .cse13 (< (+ |list_add_#in~new.offset| |list_add_#in~new.base|) 1) (< (+ |~#head~0.offset| |old(~elem~0.offset)|) 1) .cse14 (< |old(~elem~0.offset)| (+ |list_add_#in~head.offset| 1)) .cse15 .cse7 .cse16 .cse9) (or .cse2 (and (<= ~elem~0.offset |old(~elem~0.offset)|) .cse11 (<= 2 (+ |list_add_#in~new.offset| ~elem~0.base)) .cse1) (or .cse14 .cse7 (< |list_add_#in~new.offset| (+ |list_add_#in~head.offset| 2)) .cse16 .cse8) (or .cse17 (< (* 2 |~#head~0.offset|) 0) .cse9 (< (* 2 |old(~elem~0.offset)|) 0))) (or .cse3 .cse13 (< 0 .cse18) .cse4 .cse5 (< (+ |list_add_#in~new.offset| |~#head~0.offset|) 1) .cse7 .cse16 .cse8 .cse9 .cse19 (and (<= |list_add_#in~new.offset| .cse20) .cse0 .cse1)) (or (or .cse3 (not (= (mod |old(~elem~0.offset)| 2) 0)) .cse4 (< 2 .cse18)) (and (= (mod ~elem~0.offset 2) 0) (<= .cse21 2) .cse12 (<= ~elem~0.offset .cse20)) .cse17 .cse15 .cse7 .cse9 .cse19 .cse10 .cse6)))) [2018-11-10 11:56:52,650 INFO L425 ceAbstractionStarter]: For program point L891(lines 891 892) no Hoare annotation was computed. [2018-11-10 11:56:52,650 INFO L425 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-11-10 11:56:52,650 INFO L425 ceAbstractionStarter]: For program point L891-2(lines 889 893) no Hoare annotation was computed. [2018-11-10 11:56:52,650 INFO L421 ceAbstractionStarter]: At program point L890-2(line 890) the Hoare annotation is: (let ((.cse16 (+ |old(~elem~0.offset)| |old(~elem~0.base)|))) (let ((.cse9 (not (= (mod |list_add_#in~new.offset| 2) 0))) (.cse3 (< .cse16 0)) (.cse0 (< ~guard_malloc_counter~0.offset 0)) (.cse10 (< 1 (+ |old(~elem~0.offset)| |list_add_#in~new.base|))) (.cse12 (< (+ |list_add_#in~new.base| 2) |list_add_#in~new.offset|)) (.cse6 (< 0 (* 2 |list_add_#in~new.base|))) (.cse1 (< |list_add_#in~head.base| |~#head~0.base|)) (.cse2 (< |~#head~0.base| |list_add_#in~head.base|)) (.cse13 (+ |list_add_#in~head.offset| |old(~elem~0.offset)|)) (.cse15 (< |old(~elem~0.base)| |~#head~0.offset|)) (.cse11 (< .cse16 1)) (.cse5 (< (+ |list_add_#in~head.offset| |list_add_#in~new.base|) 0)) (.cse7 (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|))) (.cse14 (< |~#head~0.offset| |list_add_#in~new.base|)) (.cse8 (not (= |list_add_#in~new.offset| 1))) (.cse4 (< (+ |~#head~0.offset| 1) |list_add_#in~new.offset|))) (and (or .cse0 (or .cse1 (not (= |old(~elem~0.offset)| 0)) .cse2 .cse3 .cse4) .cse5 (< 1 (+ |list_add_#in~new.offset| |list_add_#in~head.offset|)) .cse6 .cse7 .cse8) (or .cse9 (< (+ |list_add_#in~new.offset| |list_add_#in~new.base|) 1) (< (+ |~#head~0.offset| |old(~elem~0.offset)|) 1) .cse10 (< |old(~elem~0.offset)| (+ |list_add_#in~head.offset| 1)) .cse11 .cse5 .cse12 .cse7) (or .cse1 .cse9 (< 0 .cse13) .cse2 .cse3 (< (+ |list_add_#in~new.offset| |~#head~0.offset|) 1) .cse5 .cse12 .cse6 .cse7 .cse14) (or .cse0 (or .cse10 .cse5 (< |list_add_#in~new.offset| (+ |list_add_#in~head.offset| 2)) .cse12 .cse6) (or .cse15 (< (* 2 |~#head~0.offset|) 0) .cse7 (< (* 2 |old(~elem~0.offset)|) 0))) (or (or .cse1 (not (= (mod |old(~elem~0.offset)| 2) 0)) .cse2 (< 2 .cse13)) .cse15 .cse11 .cse5 .cse7 .cse14 .cse8 .cse4)))) [2018-11-10 11:56:52,650 INFO L425 ceAbstractionStarter]: For program point L890-3(line 890) no Hoare annotation was computed. [2018-11-10 11:56:52,650 INFO L425 ceAbstractionStarter]: For program point list_addEXIT(lines 889 893) no Hoare annotation was computed. [2018-11-10 11:56:52,650 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-10 11:56:52,650 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-10 11:56:52,650 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-10 11:56:52,651 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-10 11:56:52,651 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:56:52,651 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~elem~0.offset ~elem~0.base) 0) (<= ~guard_malloc_counter~0.offset ~elem~0.base) (<= ~guard_malloc_counter~0.offset ~elem~0.offset) (<= 0 (+ |~#head~0.offset| ~guard_malloc_counter~0.base)) (<= (+ ~elem~0.offset ~guard_malloc_counter~0.base) 0) (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset)) (<= (+ |~#head~0.offset| ~elem~0.offset) 0)) [2018-11-10 11:56:52,651 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:56:52,651 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:56:52,651 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (and (<= (+ ~elem~0.offset ~elem~0.base) 0) (<= (+ ~guard_malloc_counter~0.base ~guard_malloc_counter~0.offset) 0) (<= ~guard_malloc_counter~0.offset ~elem~0.base) (<= 0 (* 2 ~guard_malloc_counter~0.base)) (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset)) (<= (+ |~#head~0.offset| ~elem~0.offset) 0)) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)) [2018-11-10 11:56:52,651 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 902 917) no Hoare annotation was computed. [2018-11-10 11:56:52,651 INFO L421 ceAbstractionStarter]: At program point L909(line 909) the Hoare annotation is: (let ((.cse0 (<= main_~dev2~0.offset (+ ~elem~0.base 2))) (.cse1 (= (mod main_~dev2~0.offset 2) 0))) (or (and (<= ~elem~0.base main_~dev2~0.base) (<= 1 (+ main_~dev2~0.offset ~elem~0.offset)) .cse0 .cse1 (<= main_~dev2~0.base ~elem~0.offset) (<= (+ |~#head~0.offset| ~elem~0.offset) 0)) (let ((.cse2 (+ ~elem~0.base 1))) (and (<= (+ ~elem~0.base main_~dev2~0.base) 0) .cse0 (<= ~elem~0.offset .cse2) (<= .cse2 main_~dev2~0.offset) (<= 2 (* 2 ~elem~0.offset)) .cse1 (<= ~elem~0.offset (+ main_~dev2~0.base 1)))) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|))) [2018-11-10 11:56:52,651 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 902 917) no Hoare annotation was computed. [2018-11-10 11:56:52,652 INFO L421 ceAbstractionStarter]: At program point L908(line 908) the Hoare annotation is: (let ((.cse3 (+ main_~dev2~0.base 1)) (.cse7 (+ ~elem~0.base 1)) (.cse6 (+ ~elem~0.base 2))) (let ((.cse0 (<= main_~dev2~0.offset .cse6)) (.cse5 (<= .cse7 main_~dev2~0.offset)) (.cse4 (* 2 ~elem~0.offset)) (.cse2 (= (mod main_~dev2~0.offset 2) 0)) (.cse1 (<= ~elem~0.offset .cse3))) (or (and (and (<= ~elem~0.base main_~dev2~0.base) (<= main_~dev2~0.base |~#head~0.offset|) .cse0 (<= main_~dev2~0.base ~elem~0.offset) .cse1) .cse2 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= 1 (+ main_~dev2~0.offset ~elem~0.offset)) (not (= main_~dev2~0.offset 0))) (and .cse2 (= main_~dev2~0.base 0) (<= .cse3 main_~dev1~0.offset) (<= (+ main_~dev1~0.offset ~elem~0.base) 1) (<= 0 .cse4) .cse5 (<= main_~dev2~0.offset (+ main_~dev1~0.base 2)) (<= 0 (+ main_~dev1~0.base ~elem~0.base)) (<= ~elem~0.offset .cse6) (<= (+ main_~dev1~0.base |~#head~0.offset|) 0)) (and (<= (+ ~elem~0.base main_~dev2~0.base) 0) .cse0 (<= ~elem~0.offset .cse7) .cse5 (<= 2 .cse4) .cse2 .cse1) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)))) [2018-11-10 11:56:52,652 INFO L421 ceAbstractionStarter]: At program point L907(line 907) the Hoare annotation is: (or (and (<= 2 (+ main_~dev2~0.offset main_~dev2~0.base)) (<= main_~dev2~0.base |~#head~0.offset|) (<= (+ main_~dev1~0.base main_~dev1~0.offset) 1) (<= (+ ~elem~0.offset ~elem~0.base) 0) (<= main_~dev2~0.offset (+ main_~dev1~0.base 2)) (<= 1 (+ ~elem~0.offset main_~dev1~0.offset)) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= 0 (+ main_~dev1~0.base ~elem~0.base)) (<= (+ main_~dev1~0.base |~#head~0.offset|) 0)) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)) [2018-11-10 11:56:52,652 INFO L425 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2018-11-10 11:56:52,652 INFO L421 ceAbstractionStarter]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse0 (<= main_~dev1~0.offset (+ main_~dev1~0.base 1))) (.cse1 (+ ~elem~0.offset ~elem~0.base)) (.cse2 (* 2 ~elem~0.offset)) (.cse3 (<= main_~dev2~0.offset (+ main_~dev1~0.base 2))) (.cse4 (<= (+ main_~dev1~0.base |~#head~0.offset|) 0))) (or (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= 2 (+ main_~dev2~0.offset main_~dev2~0.base)) (<= main_~dev2~0.base |~#head~0.offset|) (<= 3 (+ main_~dev2~0.offset main_~dev1~0.offset)) .cse0 (<= .cse1 0) (<= 0 .cse2) .cse3 (<= 0 (+ main_~dev1~0.base ~elem~0.base)) .cse4) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (and (= (mod main_~dev2~0.offset 2) 0) (= main_~dev2~0.base 0) (= (mod ~elem~0.offset 2) 0) (<= (+ main_~dev2~0.base 1) main_~dev1~0.offset) .cse0 (<= .cse1 2) (<= (+ ~elem~0.base 1) main_~dev2~0.offset) (<= 2 .cse2) .cse3 (<= ~elem~0.offset (+ ~elem~0.base 2)) .cse4) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|))) [2018-11-10 11:56:52,652 INFO L421 ceAbstractionStarter]: At program point L905(line 905) the Hoare annotation is: (or (let ((.cse0 (<= 1 (+ ~elem~0.offset ~guard_malloc_counter~0.offset))) (.cse1 (<= 0 (+ main_~dev1~0.base ~guard_malloc_counter~0.base))) (.cse2 (<= (+ ~elem~0.offset ~guard_malloc_counter~0.base) 0)) (.cse3 (<= (+ ~elem~0.offset ~elem~0.base) 0)) (.cse4 (<= (+ main_~dev1~0.base |~#head~0.offset|) 0)) (.cse5 (<= ~guard_malloc_counter~0.offset (+ ~elem~0.base 1)))) (or (and .cse0 (<= (+ main_~dev1~0.offset ~guard_malloc_counter~0.offset) 2) .cse1 .cse2 (<= ~guard_malloc_counter~0.offset main_~dev1~0.offset) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= ~guard_malloc_counter~0.offset (+ main_~dev1~0.offset 1)) (<= (* 2 main_~dev1~0.offset) 0) .cse4 .cse5))) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)) [2018-11-10 11:56:52,652 INFO L425 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2018-11-10 11:56:52,652 INFO L421 ceAbstractionStarter]: At program point L904(line 904) the Hoare annotation is: (or (and (<= (+ ~elem~0.offset ~elem~0.base) 0) (<= (+ ~guard_malloc_counter~0.base ~guard_malloc_counter~0.offset) 0) (<= ~guard_malloc_counter~0.offset ~elem~0.base) (<= 0 (* 2 ~guard_malloc_counter~0.base)) (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset)) (<= (+ |~#head~0.offset| ~elem~0.offset) 0)) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)) [2018-11-10 11:56:52,652 INFO L425 ceAbstractionStarter]: For program point L905-1(line 905) no Hoare annotation was computed. [2018-11-10 11:56:52,652 INFO L425 ceAbstractionStarter]: For program point L904-1(line 904) no Hoare annotation was computed. [2018-11-10 11:56:52,653 INFO L421 ceAbstractionStarter]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (let ((.cse0 (<= 0 (* 2 ~guard_malloc_counter~0.base))) (.cse1 (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|)) (.cse2 (< 16 (* 2 |__getMemory_#in~size|))) (.cse3 (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|))) (.cse4 (< |old(~guard_malloc_counter~0.base)| ~elem~0.offset))) (and (or (and (<= (+ ~elem~0.offset ~guard_malloc_counter~0.base) 0) .cse0 (<= 1 (+ ~elem~0.base ~guard_malloc_counter~0.offset)) (<= ~guard_malloc_counter~0.offset (+ ~elem~0.base 1))) (< (+ ~elem~0.offset ~elem~0.base) 0) (< |__getMemory_#in~size| (+ |old(~guard_malloc_counter~0.offset)| 7)) (< .cse1 1) (< 0 (+ |~#head~0.offset| ~elem~0.base)) .cse2 .cse3 .cse4) (or (and (<= (+ ~guard_malloc_counter~0.base ~guard_malloc_counter~0.offset) 0) .cse0 (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset))) (< |__getMemory_#in~size| (+ ~elem~0.base 8)) (< .cse1 0) .cse2 (< (+ |old(~guard_malloc_counter~0.base)| ~elem~0.offset) 0) .cse3 (< ~elem~0.base |old(~guard_malloc_counter~0.offset)|) .cse4))) [2018-11-10 11:56:52,653 INFO L425 ceAbstractionStarter]: For program point __getMemoryEXIT(lines 869 876) no Hoare annotation was computed. [2018-11-10 11:56:52,653 INFO L425 ceAbstractionStarter]: For program point __getMemoryFINAL(lines 869 876) no Hoare annotation was computed. [2018-11-10 11:56:52,653 INFO L425 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2018-11-10 11:56:52,653 INFO L425 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-11-10 11:56:52,653 INFO L421 ceAbstractionStarter]: At program point L871-2(line 871) the Hoare annotation is: (let ((.cse0 (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|)) (.cse1 (< 16 (* 2 |__getMemory_#in~size|))) (.cse2 (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|))) (.cse3 (< |old(~guard_malloc_counter~0.base)| ~elem~0.offset))) (and (or (< (+ ~elem~0.offset ~elem~0.base) 0) (< |__getMemory_#in~size| (+ |old(~guard_malloc_counter~0.offset)| 7)) (< .cse0 1) (< 0 (+ |~#head~0.offset| ~elem~0.base)) .cse1 .cse2 .cse3) (or (< |__getMemory_#in~size| (+ ~elem~0.base 8)) (< .cse0 0) .cse1 (< (+ |old(~guard_malloc_counter~0.base)| ~elem~0.offset) 0) .cse2 (< ~elem~0.base |old(~guard_malloc_counter~0.offset)|) .cse3))) [2018-11-10 11:56:52,653 INFO L425 ceAbstractionStarter]: For program point L871-3(line 871) no Hoare annotation was computed. [2018-11-10 11:56:52,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:56:52 BoogieIcfgContainer [2018-11-10 11:56:52,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:56:52,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:56:52,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:56:52,656 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:56:52,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:23" (3/4) ... [2018-11-10 11:56:52,658 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:56:52,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure my_malloc [2018-11-10 11:56:52,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:56:52,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2018-11-10 11:56:52,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2018-11-10 11:56:52,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-11-10 11:56:52,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:56:52,663 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __getMemory [2018-11-10 11:56:52,667 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-10 11:56:52,667 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 11:56:52,667 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 11:56:52,667 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 11:56:52,703 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7ff40ae3-5ed1-492d-b21e-cac8e4b08e83/bin-2019/utaipan/witness.graphml [2018-11-10 11:56:52,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:56:52,704 INFO L168 Benchmark]: Toolchain (without parser) took 90030.00 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 634.9 MB). Free memory was 956.6 MB in the beginning and 834.2 MB in the end (delta: 122.3 MB). Peak memory consumption was 757.2 MB. Max. memory is 11.5 GB. [2018-11-10 11:56:52,704 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:56:52,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.75 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:56:52,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -204.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:56:52,705 INFO L168 Benchmark]: Boogie Preprocessor took 18.25 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:56:52,707 INFO L168 Benchmark]: RCFGBuilder took 310.62 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:56:52,707 INFO L168 Benchmark]: TraceAbstraction took 89294.04 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 498.1 MB). Free memory was 1.1 GB in the beginning and 850.0 MB in the end (delta: 260.3 MB). Peak memory consumption was 904.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:56:52,707 INFO L168 Benchmark]: Witness Printer took 48.04 ms. Allocated memory is still 1.7 GB. Free memory was 850.0 MB in the beginning and 834.2 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:56:52,709 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.75 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 929.7 MB in the beginning and 1.1 GB in the end (delta: -204.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.25 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.62 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: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 89294.04 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 498.1 MB). Free memory was 1.1 GB in the beginning and 850.0 MB in the end (delta: 260.3 MB). Peak memory consumption was 904.4 MB. Max. memory is 11.5 GB. * Witness Printer took 48.04 ms. Allocated memory is still 1.7 GB. Free memory was 850.0 MB in the beginning and 834.2 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 47 locations, 1 error locations. SAFE Result, 89.2s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 55.4s AutomataDifference, 0.0s DeadEndRemovalTime, 10.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 348 SDtfs, 479 SDslu, 3362 SDs, 0 SdLazy, 4353 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 628 GetRequests, 187 SyntacticMatches, 7 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3992 ImplicationChecksByTransitivity, 29.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9458531746534413 AbsIntWeakeningRatio, 1.5587392550143266 AbsIntAvgWeakeningVarsNumRemoved, 173.7134670487106 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 78 PreInvPairs, 91 NumberOfFragments, 2124 HoareAnnotationTreeSize, 78 FomulaSimplifications, 6320 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 18 FomulaSimplificationsInter, 31990 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 566 ConstructedInterpolants, 0 QuantifiedInterpolants, 76586 SizeOfPredicates, 8 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 142/195 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...