./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c -s /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default-EXP.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/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 64bit --witnessprinter.graph.data.programhash 7fc5757f33cca8abec0d298407c4598828d90b8e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 07:08:12,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:08:12,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:08:12,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:08:12,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:08:12,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:08:12,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:08:12,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:08:12,995 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:08:12,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:08:12,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:08:12,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:08:12,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:08:12,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:08:12,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:08:12,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:08:12,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:08:12,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:08:13,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:08:13,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:08:13,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:08:13,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:08:13,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:08:13,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:08:13,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:08:13,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:08:13,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:08:13,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:08:13,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:08:13,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:08:13,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:08:13,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:08:13,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:08:13,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:08:13,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:08:13,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:08:13,010 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-10 07:08:13,018 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:08:13,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:08:13,019 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:08:13,019 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:08:13,019 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:08:13,019 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:08:13,019 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-10 07:08:13,020 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:08:13,020 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-10 07:08:13,020 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:08:13,020 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-10 07:08:13,020 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:08:13,020 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:08:13,020 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:08:13,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:08:13,021 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:08:13,021 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:08:13,021 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:08:13,021 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:08:13,022 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:08:13,022 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:08:13,022 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:08:13,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:08:13,022 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:08:13,022 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:08:13,022 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:08:13,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:08:13,023 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:08:13,023 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:08:13,023 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:08:13,023 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:08:13,023 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:08:13,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:08:13,023 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:08:13,024 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-10 07:08:13,024 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_63ed2532-1b40-43b9-8c58-0a6a34ee7515/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fc5757f33cca8abec0d298407c4598828d90b8e [2018-11-10 07:08:13,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:08:13,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:08:13,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:08:13,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:08:13,061 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:08:13,061 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-10 07:08:13,101 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/data/6f4b58b6e/1e5877abb21a4bbf87bcb546a2c0c6d7/FLAG3d4c797c9 [2018-11-10 07:08:13,634 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:08:13,634 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-10 07:08:13,655 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/data/6f4b58b6e/1e5877abb21a4bbf87bcb546a2c0c6d7/FLAG3d4c797c9 [2018-11-10 07:08:13,667 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/data/6f4b58b6e/1e5877abb21a4bbf87bcb546a2c0c6d7 [2018-11-10 07:08:13,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:08:13,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:08:13,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:08:13,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:08:13,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:08:13,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:08:13" (1/1) ... [2018-11-10 07:08:13,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f5db9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:13, skipping insertion in model container [2018-11-10 07:08:13,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:08:13" (1/1) ... [2018-11-10 07:08:13,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:08:13,747 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:08:14,457 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:08:14,487 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:08:14,811 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:08:14,842 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:08:14,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14 WrapperNode [2018-11-10 07:08:14,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:08:14,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:08:14,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:08:14,843 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:08:14,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:08:14,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:08:14,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:08:14,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:08:14,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... [2018-11-10 07:08:14,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:08:14,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:08:14,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:08:14,954 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:08:14,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/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 07:08:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:08:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:08:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-10 07:08:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-10 07:08:14,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-10 07:08:14,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-10 07:08:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-10 07:08:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-10 07:08:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-10 07:08:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-10 07:08:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-10 07:08:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-10 07:08:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-10 07:08:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-10 07:08:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-10 07:08:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-10 07:08:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-11-10 07:08:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-11-10 07:08:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-10 07:08:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-10 07:08:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-10 07:08:14,997 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-10 07:08:14,997 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-10 07:08:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-10 07:08:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-10 07:08:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-10 07:08:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-10 07:08:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-10 07:08:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:08:14,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:08:14,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-11-10 07:08:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-11-10 07:08:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-10 07:08:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-10 07:08:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:08:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:08:14,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-10 07:08:14,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-10 07:08:16,416 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:08:16,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:08:16 BoogieIcfgContainer [2018-11-10 07:08:16,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:08:16,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:08:16,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:08:16,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:08:16,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:08:13" (1/3) ... [2018-11-10 07:08:16,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36565263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:08:16, skipping insertion in model container [2018-11-10 07:08:16,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:08:14" (2/3) ... [2018-11-10 07:08:16,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36565263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:08:16, skipping insertion in model container [2018-11-10 07:08:16,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:08:16" (3/3) ... [2018-11-10 07:08:16,422 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-10 07:08:16,428 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:08:16,434 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:08:16,445 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:08:16,465 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:08:16,465 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:08:16,466 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:08:16,466 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:08:16,466 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:08:16,466 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:08:16,466 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:08:16,466 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:08:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-11-10 07:08:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 07:08:16,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:16,490 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:16,492 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:16,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1000997858, now seen corresponding path program 1 times [2018-11-10 07:08:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:16,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:16,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:16,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:08:16,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:16,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:08:16,807 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:16,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:08:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:08:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:16,826 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2018-11-10 07:08:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:17,352 INFO L93 Difference]: Finished difference Result 289 states and 372 transitions. [2018-11-10 07:08:17,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:08:17,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-10 07:08:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:17,363 INFO L225 Difference]: With dead ends: 289 [2018-11-10 07:08:17,364 INFO L226 Difference]: Without dead ends: 180 [2018-11-10 07:08:17,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-10 07:08:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-11-10 07:08:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-10 07:08:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 218 transitions. [2018-11-10 07:08:17,408 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 218 transitions. Word has length 65 [2018-11-10 07:08:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:17,409 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 218 transitions. [2018-11-10 07:08:17,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:08:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 218 transitions. [2018-11-10 07:08:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 07:08:17,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:17,412 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:17,412 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:17,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1366677071, now seen corresponding path program 1 times [2018-11-10 07:08:17,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:17,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:08:17,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:17,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:08:17,513 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:17,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:08:17,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:08:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,515 INFO L87 Difference]: Start difference. First operand 177 states and 218 transitions. Second operand 3 states. [2018-11-10 07:08:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:17,542 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2018-11-10 07:08:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:08:17,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-10 07:08:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:17,545 INFO L225 Difference]: With dead ends: 187 [2018-11-10 07:08:17,545 INFO L226 Difference]: Without dead ends: 182 [2018-11-10 07:08:17,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-10 07:08:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2018-11-10 07:08:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-10 07:08:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 217 transitions. [2018-11-10 07:08:17,561 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 217 transitions. Word has length 68 [2018-11-10 07:08:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:17,562 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 217 transitions. [2018-11-10 07:08:17,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:08:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 217 transitions. [2018-11-10 07:08:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 07:08:17,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:17,563 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:17,564 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:17,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1423935373, now seen corresponding path program 1 times [2018-11-10 07:08:17,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:08:17,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:17,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:08:17,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:17,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:08:17,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:08:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,640 INFO L87 Difference]: Start difference. First operand 177 states and 217 transitions. Second operand 3 states. [2018-11-10 07:08:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:17,680 INFO L93 Difference]: Finished difference Result 464 states and 588 transitions. [2018-11-10 07:08:17,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:08:17,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-10 07:08:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:17,685 INFO L225 Difference]: With dead ends: 464 [2018-11-10 07:08:17,685 INFO L226 Difference]: Without dead ends: 312 [2018-11-10 07:08:17,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-10 07:08:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2018-11-10 07:08:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-10 07:08:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 387 transitions. [2018-11-10 07:08:17,708 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 387 transitions. Word has length 68 [2018-11-10 07:08:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:17,708 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 387 transitions. [2018-11-10 07:08:17,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:08:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 387 transitions. [2018-11-10 07:08:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 07:08:17,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:17,711 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:17,711 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:17,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:17,712 INFO L82 PathProgramCache]: Analyzing trace with hash -204261721, now seen corresponding path program 1 times [2018-11-10 07:08:17,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 07:08:17,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:17,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:08:17,789 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:17,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:08:17,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:08:17,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,790 INFO L87 Difference]: Start difference. First operand 308 states and 387 transitions. Second operand 3 states. [2018-11-10 07:08:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:17,823 INFO L93 Difference]: Finished difference Result 660 states and 841 transitions. [2018-11-10 07:08:17,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:08:17,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-10 07:08:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:17,826 INFO L225 Difference]: With dead ends: 660 [2018-11-10 07:08:17,826 INFO L226 Difference]: Without dead ends: 384 [2018-11-10 07:08:17,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-10 07:08:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-11-10 07:08:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-10 07:08:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 477 transitions. [2018-11-10 07:08:17,845 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 477 transitions. Word has length 87 [2018-11-10 07:08:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:17,845 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 477 transitions. [2018-11-10 07:08:17,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:08:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 477 transitions. [2018-11-10 07:08:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 07:08:17,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:17,847 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:17,847 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:17,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash -507815914, now seen corresponding path program 1 times [2018-11-10 07:08:17,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:17,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,851 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 07:08:17,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:17,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:08:17,938 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:17,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:08:17,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:08:17,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,939 INFO L87 Difference]: Start difference. First operand 374 states and 477 transitions. Second operand 3 states. [2018-11-10 07:08:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:17,953 INFO L93 Difference]: Finished difference Result 732 states and 946 transitions. [2018-11-10 07:08:17,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:08:17,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-11-10 07:08:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:17,956 INFO L225 Difference]: With dead ends: 732 [2018-11-10 07:08:17,956 INFO L226 Difference]: Without dead ends: 390 [2018-11-10 07:08:17,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-10 07:08:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2018-11-10 07:08:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-10 07:08:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 481 transitions. [2018-11-10 07:08:17,970 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 481 transitions. Word has length 101 [2018-11-10 07:08:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:17,970 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 481 transitions. [2018-11-10 07:08:17,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:08:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 481 transitions. [2018-11-10 07:08:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 07:08:17,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:17,972 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:17,972 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:17,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 772047764, now seen corresponding path program 1 times [2018-11-10 07:08:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:17,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:17,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:17,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 07:08:18,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:18,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:08:18,094 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:18,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:08:18,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:08:18,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:08:18,095 INFO L87 Difference]: Start difference. First operand 378 states and 481 transitions. Second operand 7 states. [2018-11-10 07:08:18,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:18,127 INFO L93 Difference]: Finished difference Result 719 states and 923 transitions. [2018-11-10 07:08:18,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:08:18,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-11-10 07:08:18,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:18,130 INFO L225 Difference]: With dead ends: 719 [2018-11-10 07:08:18,130 INFO L226 Difference]: Without dead ends: 373 [2018-11-10 07:08:18,131 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 07:08:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-11-10 07:08:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 367. [2018-11-10 07:08:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-10 07:08:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 464 transitions. [2018-11-10 07:08:18,144 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 464 transitions. Word has length 101 [2018-11-10 07:08:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:18,144 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 464 transitions. [2018-11-10 07:08:18,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:08:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 464 transitions. [2018-11-10 07:08:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 07:08:18,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:18,146 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:18,146 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:18,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash -82314792, now seen corresponding path program 1 times [2018-11-10 07:08:18,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:18,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:18,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:18,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 07:08:18,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:18,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:08:18,312 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:18,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:08:18,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:08:18,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:08:18,313 INFO L87 Difference]: Start difference. First operand 367 states and 464 transitions. Second operand 7 states. [2018-11-10 07:08:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:20,183 INFO L93 Difference]: Finished difference Result 599 states and 751 transitions. [2018-11-10 07:08:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:08:20,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-10 07:08:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:20,185 INFO L225 Difference]: With dead ends: 599 [2018-11-10 07:08:20,185 INFO L226 Difference]: Without dead ends: 596 [2018-11-10 07:08:20,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:08:20,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-11-10 07:08:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 564. [2018-11-10 07:08:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-11-10 07:08:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 717 transitions. [2018-11-10 07:08:20,205 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 717 transitions. Word has length 107 [2018-11-10 07:08:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:20,206 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 717 transitions. [2018-11-10 07:08:20,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:08:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 717 transitions. [2018-11-10 07:08:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 07:08:20,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:20,207 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:20,207 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:20,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1693879225, now seen corresponding path program 1 times [2018-11-10 07:08:20,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:20,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:20,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 07:08:20,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:20,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:08:20,294 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:20,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 07:08:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:08:20,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:08:20,295 INFO L87 Difference]: Start difference. First operand 564 states and 717 transitions. Second operand 7 states. [2018-11-10 07:08:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:20,327 INFO L93 Difference]: Finished difference Result 967 states and 1229 transitions. [2018-11-10 07:08:20,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:08:20,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-10 07:08:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:20,329 INFO L225 Difference]: With dead ends: 967 [2018-11-10 07:08:20,329 INFO L226 Difference]: Without dead ends: 568 [2018-11-10 07:08:20,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 07:08:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-11-10 07:08:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 562. [2018-11-10 07:08:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-11-10 07:08:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 711 transitions. [2018-11-10 07:08:20,344 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 711 transitions. Word has length 113 [2018-11-10 07:08:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:20,345 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 711 transitions. [2018-11-10 07:08:20,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 07:08:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 711 transitions. [2018-11-10 07:08:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 07:08:20,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:20,346 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:20,346 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:20,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2116581051, now seen corresponding path program 1 times [2018-11-10 07:08:20,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:20,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:20,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:20,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 07:08:20,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:20,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:08:20,400 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:20,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:08:20,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:08:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:20,401 INFO L87 Difference]: Start difference. First operand 562 states and 711 transitions. Second operand 3 states. [2018-11-10 07:08:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:20,420 INFO L93 Difference]: Finished difference Result 965 states and 1219 transitions. [2018-11-10 07:08:20,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:08:20,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-11-10 07:08:20,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:20,423 INFO L225 Difference]: With dead ends: 965 [2018-11-10 07:08:20,423 INFO L226 Difference]: Without dead ends: 568 [2018-11-10 07:08:20,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:08:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-11-10 07:08:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 562. [2018-11-10 07:08:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-11-10 07:08:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 707 transitions. [2018-11-10 07:08:20,438 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 707 transitions. Word has length 113 [2018-11-10 07:08:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:20,438 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 707 transitions. [2018-11-10 07:08:20,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:08:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 707 transitions. [2018-11-10 07:08:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 07:08:20,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:20,440 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:20,441 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:20,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1875927130, now seen corresponding path program 1 times [2018-11-10 07:08:20,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:20,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:20,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:20,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:20,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:20,635 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-11-10 07:08:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 07:08:20,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:20,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:08:20,702 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:20,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:08:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:08:20,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:08:20,703 INFO L87 Difference]: Start difference. First operand 562 states and 707 transitions. Second operand 6 states. [2018-11-10 07:08:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:20,857 INFO L93 Difference]: Finished difference Result 1123 states and 1414 transitions. [2018-11-10 07:08:20,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:08:20,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-10 07:08:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:20,859 INFO L225 Difference]: With dead ends: 1123 [2018-11-10 07:08:20,859 INFO L226 Difference]: Without dead ends: 563 [2018-11-10 07:08:20,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:08:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-10 07:08:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2018-11-10 07:08:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-10 07:08:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 708 transitions. [2018-11-10 07:08:20,880 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 708 transitions. Word has length 128 [2018-11-10 07:08:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:20,880 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 708 transitions. [2018-11-10 07:08:20,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:08:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 708 transitions. [2018-11-10 07:08:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 07:08:20,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:20,882 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:20,882 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:20,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:20,882 INFO L82 PathProgramCache]: Analyzing trace with hash -351816080, now seen corresponding path program 1 times [2018-11-10 07:08:20,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:20,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:20,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:20,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:20,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:08:21,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:21,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:08:21,058 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:21,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:08:21,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:08:21,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:08:21,059 INFO L87 Difference]: Start difference. First operand 563 states and 708 transitions. Second operand 6 states. [2018-11-10 07:08:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:21,170 INFO L93 Difference]: Finished difference Result 1111 states and 1400 transitions. [2018-11-10 07:08:21,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:08:21,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-10 07:08:21,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:21,173 INFO L225 Difference]: With dead ends: 1111 [2018-11-10 07:08:21,173 INFO L226 Difference]: Without dead ends: 564 [2018-11-10 07:08:21,175 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 07:08:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-11-10 07:08:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2018-11-10 07:08:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-11-10 07:08:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 709 transitions. [2018-11-10 07:08:21,195 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 709 transitions. Word has length 130 [2018-11-10 07:08:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:21,195 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 709 transitions. [2018-11-10 07:08:21,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:08:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 709 transitions. [2018-11-10 07:08:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 07:08:21,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:21,197 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:21,197 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:21,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash 675645658, now seen corresponding path program 1 times [2018-11-10 07:08:21,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:21,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:21,200 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:08:21,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:08:21,350 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:08:21,350 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2018-11-10 07:08:21,352 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [7], [8], [9], [10], [12], [14], [16], [18], [20], [23], [26], [29], [32], [34], [53], [56], [59], [62], [65], [67], [71], [74], [77], [79], [82], [90], [123], [124], [125], [127], [128], [129], [132], [134], [137], [140], [141], [142], [143], [144], [145], [148], [150], [151], [152], [157], [160], [164], [169], [171], [174], [182], [184], [186], [188], [189], [192], [203], [216], [218], [219], [221], [222], [223], [227], [229], [230], [231], [233], [234], [235], [236], [237], [238], [239], [240], [241], [242], [243], [244], [245], [248], [249], [250], [251], [256], [258], [259], [260], [261], [262], [263], [264], [265], [266], [267], [268], [269], [270], [272], [273], [274], [278], [279], [280], [281] [2018-11-10 07:08:21,385 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-10 07:08:21,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:08:22,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 07:08:22,779 INFO L272 AbstractInterpreter]: Visited 109 different actions 495 times. Merged at 27 different actions 112 times. Widened at 1 different actions 2 times. Found 19 fixpoints after 8 different actions. Largest state had 138 variables. [2018-11-10 07:08:22,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:22,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 07:08:22,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:08:22,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/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 07:08:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:22,815 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 07:08:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:23,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:08:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:08:23,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:08:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 07:08:23,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:08:23,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-11-10 07:08:23,460 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:08:23,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 07:08:23,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 07:08:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:08:23,461 INFO L87 Difference]: Start difference. First operand 564 states and 709 transitions. Second operand 12 states. [2018-11-10 07:08:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:23,543 INFO L93 Difference]: Finished difference Result 1113 states and 1402 transitions. [2018-11-10 07:08:23,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:08:23,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2018-11-10 07:08:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:23,545 INFO L225 Difference]: With dead ends: 1113 [2018-11-10 07:08:23,545 INFO L226 Difference]: Without dead ends: 565 [2018-11-10 07:08:23,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 253 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-10 07:08:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-11-10 07:08:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2018-11-10 07:08:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-11-10 07:08:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 710 transitions. [2018-11-10 07:08:23,564 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 710 transitions. Word has length 132 [2018-11-10 07:08:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:23,564 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 710 transitions. [2018-11-10 07:08:23,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 07:08:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 710 transitions. [2018-11-10 07:08:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 07:08:23,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:23,566 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:23,566 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:23,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash -145210960, now seen corresponding path program 2 times [2018-11-10 07:08:23,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:23,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:23,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 07:08:23,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:08:23,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:08:23,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:08:23,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:08:23,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:08:23,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:08:23,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:08:23,702 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:08:24,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 07:08:24,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:08:24,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:08:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 07:08:24,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:08:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 07:08:24,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:08:24,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2018-11-10 07:08:24,788 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:08:24,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 07:08:24,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 07:08:24,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-11-10 07:08:24,789 INFO L87 Difference]: Start difference. First operand 565 states and 710 transitions. Second operand 13 states. [2018-11-10 07:08:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:24,950 INFO L93 Difference]: Finished difference Result 1115 states and 1404 transitions. [2018-11-10 07:08:24,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:08:24,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 134 [2018-11-10 07:08:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:24,953 INFO L225 Difference]: With dead ends: 1115 [2018-11-10 07:08:24,953 INFO L226 Difference]: Without dead ends: 566 [2018-11-10 07:08:24,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 255 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-11-10 07:08:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-11-10 07:08:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2018-11-10 07:08:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-11-10 07:08:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 711 transitions. [2018-11-10 07:08:24,969 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 711 transitions. Word has length 134 [2018-11-10 07:08:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:24,970 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 711 transitions. [2018-11-10 07:08:24,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 07:08:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 711 transitions. [2018-11-10 07:08:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 07:08:24,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:24,971 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:24,971 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:24,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1566875238, now seen corresponding path program 3 times [2018-11-10 07:08:24,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:24,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:24,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:08:24,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:24,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 07:08:25,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:08:25,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:08:25,105 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:08:25,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:08:25,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:08:25,105 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:08:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 07:08:25,116 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 07:08:25,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 07:08:25,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:08:25,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:08:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 07:08:26,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:08:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 07:08:26,985 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:08:26,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [9] total 31 [2018-11-10 07:08:26,986 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:26,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:08:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:08:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2018-11-10 07:08:26,987 INFO L87 Difference]: Start difference. First operand 566 states and 711 transitions. Second operand 14 states. [2018-11-10 07:08:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:38,604 INFO L93 Difference]: Finished difference Result 1017 states and 1257 transitions. [2018-11-10 07:08:38,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 07:08:38,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-11-10 07:08:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:38,608 INFO L225 Difference]: With dead ends: 1017 [2018-11-10 07:08:38,608 INFO L226 Difference]: Without dead ends: 604 [2018-11-10 07:08:38,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 245 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2018-11-10 07:08:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-11-10 07:08:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 407. [2018-11-10 07:08:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-10 07:08:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 498 transitions. [2018-11-10 07:08:38,631 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 498 transitions. Word has length 136 [2018-11-10 07:08:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:38,631 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 498 transitions. [2018-11-10 07:08:38,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:08:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 498 transitions. [2018-11-10 07:08:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 07:08:38,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:38,633 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:08:38,633 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:38,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:38,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2027987310, now seen corresponding path program 1 times [2018-11-10 07:08:38,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:38,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:08:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:38,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 07:08:38,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:38,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 07:08:38,853 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:38,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:08:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:08:38,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:08:38,854 INFO L87 Difference]: Start difference. First operand 407 states and 498 transitions. Second operand 9 states. [2018-11-10 07:08:39,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:39,257 INFO L93 Difference]: Finished difference Result 409 states and 499 transitions. [2018-11-10 07:08:39,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:08:39,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-11-10 07:08:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:39,259 INFO L225 Difference]: With dead ends: 409 [2018-11-10 07:08:39,259 INFO L226 Difference]: Without dead ends: 399 [2018-11-10 07:08:39,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:08:39,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-10 07:08:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-11-10 07:08:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 07:08:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 486 transitions. [2018-11-10 07:08:39,272 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 486 transitions. Word has length 138 [2018-11-10 07:08:39,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:39,272 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 486 transitions. [2018-11-10 07:08:39,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:08:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 486 transitions. [2018-11-10 07:08:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 07:08:39,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:08:39,274 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:08:39,275 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:08:39,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:08:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash 888167001, now seen corresponding path program 1 times [2018-11-10 07:08:39,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:08:39,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:39,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:08:39,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:08:39,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:08:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:08:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 07:08:39,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:08:39,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:08:39,441 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:08:39,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:08:39,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:08:39,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:08:39,442 INFO L87 Difference]: Start difference. First operand 399 states and 486 transitions. Second operand 6 states. [2018-11-10 07:08:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:08:40,302 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2018-11-10 07:08:40,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:08:40,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2018-11-10 07:08:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:08:40,302 INFO L225 Difference]: With dead ends: 399 [2018-11-10 07:08:40,303 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:08:40,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:08:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:08:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:08:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:08:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:08:40,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2018-11-10 07:08:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:08:40,304 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:08:40,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:08:40,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:08:40,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:08:40,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:08:40,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:08:40,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:08:40,584 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2018-11-10 07:08:41,045 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 23 [2018-11-10 07:08:41,574 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 11 [2018-11-10 07:08:41,874 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-10 07:08:41,875 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~int~TO~intEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L428 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~X~int~TO~intENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~int~TO~intFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6237(lines 6237 6268) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 6188 6283) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6213(lines 6213 6276) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6238(line 6238) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6247(line 6247) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6214(line 6214) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6280(line 6280) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6239(lines 6239 6245) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L421 ceAbstractionStarter]: At program point L6206(line 6206) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6206-1(line 6206) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 6188 6283) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6215(lines 6215 6232) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L425 ceAbstractionStarter]: For program point L6248(lines 6248 6264) no Hoare annotation was computed. [2018-11-10 07:08:41,875 INFO L421 ceAbstractionStarter]: At program point L6207(line 6207) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,876 INFO L425 ceAbstractionStarter]: For program point L6240-1(line 6240) no Hoare annotation was computed. [2018-11-10 07:08:41,876 INFO L425 ceAbstractionStarter]: For program point L6207-1(line 6207) no Hoare annotation was computed. [2018-11-10 07:08:41,876 INFO L421 ceAbstractionStarter]: At program point L6240(line 6240) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,876 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 6188 6283) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,876 INFO L421 ceAbstractionStarter]: At program point L6249(line 6249) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0) (= 1 ~ldv_state_variable_0~0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,876 INFO L425 ceAbstractionStarter]: For program point L6249-1(line 6249) no Hoare annotation was computed. [2018-11-10 07:08:41,876 INFO L425 ceAbstractionStarter]: For program point L6274(line 6274) no Hoare annotation was computed. [2018-11-10 07:08:41,876 INFO L425 ceAbstractionStarter]: For program point L6266(line 6266) no Hoare annotation was computed. [2018-11-10 07:08:41,876 INFO L421 ceAbstractionStarter]: At program point L6258(lines 6200 6282) the Hoare annotation is: (or (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,876 INFO L425 ceAbstractionStarter]: For program point L6250(lines 6250 6255) no Hoare annotation was computed. [2018-11-10 07:08:41,876 INFO L425 ceAbstractionStarter]: For program point L6217(lines 6217 6228) no Hoare annotation was computed. [2018-11-10 07:08:41,876 INFO L425 ceAbstractionStarter]: For program point L6250-2(lines 6248 6262) no Hoare annotation was computed. [2018-11-10 07:08:41,876 INFO L428 ceAbstractionStarter]: At program point L6275(line 6275) the Hoare annotation is: true [2018-11-10 07:08:41,876 INFO L428 ceAbstractionStarter]: At program point L6267(line 6267) the Hoare annotation is: true [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L6234(line 6234) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L421 ceAbstractionStarter]: At program point L6201(line 6201) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L6201-1(line 6201) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L6226(line 6226) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L6218(line 6218) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L6235(lines 6235 6272) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L428 ceAbstractionStarter]: At program point L6227(line 6227) the Hoare annotation is: true [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L6219(lines 6219 6224) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L421 ceAbstractionStarter]: At program point L6277(lines 6200 6282) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,877 INFO L421 ceAbstractionStarter]: At program point L6203(line 6203) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L6203-1(line 6203) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L6220-1(line 6220) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L421 ceAbstractionStarter]: At program point L6220(line 6220) the Hoare annotation is: (or (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (not (= 0 |old(~ldv_retval_0~0)|)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 07:08:41,877 INFO L428 ceAbstractionStarter]: At program point ldv_undef_intENTRY(lines 5909 5917) the Hoare annotation is: true [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point ldv_undef_intFINAL(lines 5909 5917) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point ldv_undef_intEXIT(lines 5909 5917) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point ldv_init_zallocFINAL(lines 5888 5899) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point ldv_init_zallocEXIT(lines 5888 5899) no Hoare annotation was computed. [2018-11-10 07:08:41,877 INFO L421 ceAbstractionStarter]: At program point L5894(line 5894) the Hoare annotation is: (or (let ((.cse0 (div ldv_init_zalloc_~size 4294967296))) (let ((.cse1 (* 4294967296 .cse0))) (and (or (< 0 .cse0) (<= |ldv_init_zalloc_#in~size| ldv_init_zalloc_~size)) (or (<= (+ .cse1 2147483648) |ldv_init_zalloc_#in~size|) (<= ldv_init_zalloc_~size (+ .cse1 2147483647)) (<= (+ .cse0 1) 0)) (or (<= .cse0 0) (<= .cse1 |ldv_init_zalloc_#in~size|))))) (not (= 1 ~ldv_module_refcounter~0)) (not (= 0 ~ldv_retval_0~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 07:08:41,877 INFO L428 ceAbstractionStarter]: At program point ldv_init_zallocENTRY(lines 5888 5899) the Hoare annotation is: true [2018-11-10 07:08:41,877 INFO L425 ceAbstractionStarter]: For program point L5894-1(line 5894) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L421 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 6369 6387) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point L6374(lines 6374 6384) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point L6375-1(line 6375) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L421 ceAbstractionStarter]: At program point L6375(line 6375) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (and (not (= (mod (+ |ldv_try_module_get_#in~module.base| |ldv_try_module_get_#in~module.offset|) 18446744073709551616) 0)) (= 1 ~ldv_module_refcounter~0) (= ldv_try_module_get_~module.base |ldv_try_module_get_#in~module.base|) (= ldv_try_module_get_~module.offset |ldv_try_module_get_#in~module.offset|)) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point L6376(lines 6376 6381) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 6369 6387) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 6369 6387) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point pppox_initFINAL(lines 6167 6175) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L428 ceAbstractionStarter]: At program point pppox_initENTRY(lines 6167 6175) the Hoare annotation is: true [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point pppox_initEXIT(lines 6167 6175) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L425 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 6303 6311) no Hoare annotation was computed. [2018-11-10 07:08:41,878 INFO L428 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 6303 6311) the Hoare annotation is: true [2018-11-10 07:08:41,879 INFO L425 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6309) no Hoare annotation was computed. [2018-11-10 07:08:41,879 INFO L425 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 6303 6311) no Hoare annotation was computed. [2018-11-10 07:08:41,879 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_get_5EXIT(lines 6284 6292) no Hoare annotation was computed. [2018-11-10 07:08:41,879 INFO L421 ceAbstractionStarter]: At program point L6289(line 6289) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (= ldv_try_module_get_5_~ldv_func_arg1.base |ldv_try_module_get_5_#in~ldv_func_arg1.base|) (= |ldv_try_module_get_5_#in~ldv_func_arg1.offset| ldv_try_module_get_5_~ldv_func_arg1.offset) (= 1 ~ldv_module_refcounter~0))) [2018-11-10 07:08:41,879 INFO L425 ceAbstractionStarter]: For program point L6289-1(line 6289) no Hoare annotation was computed. [2018-11-10 07:08:41,879 INFO L421 ceAbstractionStarter]: At program point ldv_try_module_get_5ENTRY(lines 6284 6292) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 07:08:41,879 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_get_5FINAL(lines 6284 6292) no Hoare annotation was computed. [2018-11-10 07:08:41,879 INFO L425 ceAbstractionStarter]: For program point L6140-2(lines 6140 6144) no Hoare annotation was computed. [2018-11-10 07:08:41,879 INFO L425 ceAbstractionStarter]: For program point L6140(lines 6140 6144) no Hoare annotation was computed. [2018-11-10 07:08:41,879 INFO L425 ceAbstractionStarter]: For program point L6134(lines 6134 6138) no Hoare annotation was computed. [2018-11-10 07:08:41,880 INFO L421 ceAbstractionStarter]: At program point L6161(line 6161) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (and (not (= 0 (mod (let ((.cse2 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (+ (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) 18446744073709551616))) (= pppox_create_~tmp~9 1) (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (= pppox_create_~tmp___0~3 0) (exists ((pppox_create_~protocol Int)) (let ((.cse7 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7) 16))) (let ((.cse4 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse3 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (and (not (= 0 (mod (+ .cse3 .cse4) 18446744073709551616))) (= .cse4 |pppox_create_#t~mem67.base|) (= |pppox_create_#t~mem67.offset| .cse3))))))) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 07:08:41,880 INFO L425 ceAbstractionStarter]: For program point L6161-1(line 6161) no Hoare annotation was computed. [2018-11-10 07:08:41,880 INFO L425 ceAbstractionStarter]: For program point pppox_createFINAL(lines 6126 6165) no Hoare annotation was computed. [2018-11-10 07:08:41,880 INFO L425 ceAbstractionStarter]: For program point L6149-2(lines 6147 6159) no Hoare annotation was computed. [2018-11-10 07:08:41,880 INFO L425 ceAbstractionStarter]: For program point L6149(lines 6149 6153) no Hoare annotation was computed. [2018-11-10 07:08:41,880 INFO L425 ceAbstractionStarter]: For program point L6145(lines 6145 6159) no Hoare annotation was computed. [2018-11-10 07:08:41,880 INFO L421 ceAbstractionStarter]: At program point pppox_createENTRY(lines 6126 6165) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 07:08:41,880 INFO L421 ceAbstractionStarter]: At program point L6162(lines 6132 6164) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (= 1 ~ldv_module_refcounter~0) (not (= 1 |old(~ldv_module_refcounter~0)|))) [2018-11-10 07:08:41,880 INFO L425 ceAbstractionStarter]: For program point L6160-1(line 6160) no Hoare annotation was computed. [2018-11-10 07:08:41,880 INFO L421 ceAbstractionStarter]: At program point L6160(line 6160) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (and (not (= 0 (mod (let ((.cse2 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (+ (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) 18446744073709551616))) (= pppox_create_~tmp~9 1) (<= ~ldv_module_refcounter~0 2) (<= 2 ~ldv_module_refcounter~0) (= pppox_create_~tmp___0~3 0))) [2018-11-10 07:08:41,880 INFO L425 ceAbstractionStarter]: For program point pppox_createEXIT(lines 6126 6165) no Hoare annotation was computed. [2018-11-10 07:08:41,881 INFO L425 ceAbstractionStarter]: For program point L6148-1(line 6148) no Hoare annotation was computed. [2018-11-10 07:08:41,881 INFO L421 ceAbstractionStarter]: At program point L6148(line 6148) the Hoare annotation is: (or (not (= 0 ~ldv_retval_0~0)) (not (= 1 |old(~ldv_module_refcounter~0)|)) (let ((.cse2 (+ (* 8 pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (and (= 1 ~ldv_module_refcounter~0) (= |pppox_create_#t~mem56.base| (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= |pppox_create_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))))) [2018-11-10 07:08:41,881 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 6424 6436) the Hoare annotation is: true [2018-11-10 07:08:41,881 INFO L421 ceAbstractionStarter]: At program point L6430(line 6430) the Hoare annotation is: (not (= 1 ~ldv_module_refcounter~0)) [2018-11-10 07:08:41,881 INFO L425 ceAbstractionStarter]: For program point L6429(lines 6424 6436) no Hoare annotation was computed. [2018-11-10 07:08:41,881 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 6424 6436) no Hoare annotation was computed. [2018-11-10 07:08:41,881 INFO L425 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 5936 5944) no Hoare annotation was computed. [2018-11-10 07:08:41,881 INFO L425 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 5936 5944) no Hoare annotation was computed. [2018-11-10 07:08:41,881 INFO L428 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 5936 5944) the Hoare annotation is: true [2018-11-10 07:08:41,881 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,881 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~ldv_retval_0~0 0) (= 1 ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 0)) [2018-11-10 07:08:41,881 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:08:41,882 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,882 INFO L425 ceAbstractionStarter]: For program point L6394(lines 6394 6398) no Hoare annotation was computed. [2018-11-10 07:08:41,882 INFO L421 ceAbstractionStarter]: At program point L6395(line 6395) the Hoare annotation is: (or (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 Int)) (= 0 (mod (let ((.cse2 (+ (* 8 v_pppox_create_~protocol_BEFORE_CALL_2) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (+ (select (select |#memory_$Pointer$.base| .cse0) .cse1) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) 18446744073709551616))) (< |old(~ldv_module_refcounter~0)| 2) (not (= 0 ~ldv_retval_0~0))) [2018-11-10 07:08:41,882 INFO L425 ceAbstractionStarter]: For program point L6393-2(lines 6388 6405) no Hoare annotation was computed. [2018-11-10 07:08:41,882 INFO L421 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 6388 6405) the Hoare annotation is: (or (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 Int)) (= 0 (mod (let ((.cse2 (+ (* 8 v_pppox_create_~protocol_BEFORE_CALL_2) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (+ (select (select |#memory_$Pointer$.base| .cse0) .cse1) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) 18446744073709551616))) (< |old(~ldv_module_refcounter~0)| 2) (not (= 0 ~ldv_retval_0~0)) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-10 07:08:41,882 INFO L425 ceAbstractionStarter]: For program point L6393(lines 6393 6402) no Hoare annotation was computed. [2018-11-10 07:08:41,882 INFO L425 ceAbstractionStarter]: For program point L6394-1(lines 6394 6398) no Hoare annotation was computed. [2018-11-10 07:08:41,882 INFO L425 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 6388 6405) no Hoare annotation was computed. [2018-11-10 07:08:41,882 INFO L425 ceAbstractionStarter]: For program point ldv_memsetFINAL(lines 5900 5908) no Hoare annotation was computed. [2018-11-10 07:08:41,882 INFO L421 ceAbstractionStarter]: At program point L5905(line 5905) the Hoare annotation is: (or (= |ldv_memset_#in~n| ldv_memset_~n) (not (= 1 ~ldv_module_refcounter~0)) (not (= 0 ~ldv_retval_0~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 07:08:41,882 INFO L425 ceAbstractionStarter]: For program point L5905-1(line 5905) no Hoare annotation was computed. [2018-11-10 07:08:41,883 INFO L428 ceAbstractionStarter]: At program point ldv_memsetENTRY(lines 5900 5908) the Hoare annotation is: true [2018-11-10 07:08:41,883 INFO L425 ceAbstractionStarter]: For program point ldv_memsetEXIT(lines 5900 5908) no Hoare annotation was computed. [2018-11-10 07:08:41,883 INFO L428 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:08:41,883 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-10 07:08:41,883 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,883 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:08:41,883 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_6EXIT(lines 6293 6301) no Hoare annotation was computed. [2018-11-10 07:08:41,883 INFO L421 ceAbstractionStarter]: At program point L6298(line 6298) the Hoare annotation is: (or (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 Int)) (= 0 (mod (let ((.cse2 (+ (* 8 v_pppox_create_~protocol_BEFORE_CALL_2) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (+ (select (select |#memory_$Pointer$.base| .cse0) .cse1) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) 18446744073709551616))) (< |old(~ldv_module_refcounter~0)| 2) (and (= ldv_module_put_6_~ldv_func_arg1.offset |ldv_module_put_6_#in~ldv_func_arg1.offset|) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) (= ldv_module_put_6_~ldv_func_arg1.base |ldv_module_put_6_#in~ldv_func_arg1.base|)) (not (= 0 ~ldv_retval_0~0))) [2018-11-10 07:08:41,883 INFO L421 ceAbstractionStarter]: At program point ldv_module_put_6ENTRY(lines 6293 6301) the Hoare annotation is: (or (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 Int)) (= 0 (mod (let ((.cse2 (+ (* 8 v_pppox_create_~protocol_BEFORE_CALL_2) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) 16))) (+ (select (select |#memory_$Pointer$.base| .cse0) .cse1) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)))) 18446744073709551616))) (< |old(~ldv_module_refcounter~0)| 2) (not (= 0 ~ldv_retval_0~0)) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-10 07:08:41,883 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_6FINAL(lines 6293 6301) no Hoare annotation was computed. [2018-11-10 07:08:41,883 INFO L425 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 6176 6184) no Hoare annotation was computed. [2018-11-10 07:08:41,883 INFO L428 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 6176 6184) the Hoare annotation is: true [2018-11-10 07:08:41,884 INFO L425 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 6176 6184) no Hoare annotation was computed. [2018-11-10 07:08:41,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:08:41 BoogieIcfgContainer [2018-11-10 07:08:41,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:08:41,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:08:41,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:08:41,891 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:08:41,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:08:16" (3/4) ... [2018-11-10 07:08:41,895 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2018-11-10 07:08:41,900 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_5 [2018-11-10 07:08:41,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-11-10 07:08:41,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-10 07:08:41,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2018-11-10 07:08:41,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-11-10 07:08:41,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2018-11-10 07:08:41,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-11-10 07:08:41,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_6 [2018-11-10 07:08:41,901 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-11-10 07:08:41,918 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 265 nodes and edges [2018-11-10 07:08:41,919 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2018-11-10 07:08:41,920 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 90 nodes and edges [2018-11-10 07:08:41,921 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 07:08:41,922 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:08:41,948 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_retval_0 == 0 && 1 == ldv_module_refcounter) || !(1 == \old(ldv_module_refcounter))) || !(0 == \old(ldv_retval_0))) || !(0 == \old(ldv_state_variable_1)) [2018-11-10 07:08:41,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter))) || !(0 == \old(ldv_retval_0))) || !(0 == \old(ldv_state_variable_1)) [2018-11-10 07:08:41,949 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0 == ldv_retval_0) || 1 == ldv_module_refcounter) || !(1 == \old(ldv_module_refcounter)) [2018-11-10 07:08:42,021 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_63ed2532-1b40-43b9-8c58-0a6a34ee7515/bin-2019/utaipan/witness.graphml [2018-11-10 07:08:42,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:08:42,021 INFO L168 Benchmark]: Toolchain (without parser) took 28351.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 469.2 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -68.5 MB). Peak memory consumption was 400.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:08:42,022 INFO L168 Benchmark]: CDTParser took 0.16 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 07:08:42,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1171.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -75.5 MB). Peak memory consumption was 189.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:08:42,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:08:42,023 INFO L168 Benchmark]: Boogie Preprocessor took 51.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:08:42,023 INFO L168 Benchmark]: RCFGBuilder took 1462.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 157.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:08:42,023 INFO L168 Benchmark]: TraceAbstraction took 25473.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 261.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Peak memory consumption was 344.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:08:42,023 INFO L168 Benchmark]: Witness Printer took 130.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:08:42,026 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.16 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 1171.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -75.5 MB). Peak memory consumption was 189.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1462.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 157.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25473.42 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 261.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Peak memory consumption was 344.4 MB. Max. memory is 11.5 GB. * Witness Printer took 130.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6309]: 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 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6200]: Loop Invariant Derived loop invariant: ((1 == ldv_module_refcounter || !(1 == \old(ldv_module_refcounter))) || !(0 == \old(ldv_retval_0))) || !(0 == \old(ldv_state_variable_1)) - InvariantResult [Line: 6200]: Loop Invariant Derived loop invariant: (((ldv_retval_0 == 0 && 1 == ldv_module_refcounter) || !(1 == \old(ldv_module_refcounter))) || !(0 == \old(ldv_retval_0))) || !(0 == \old(ldv_state_variable_1)) - InvariantResult [Line: 6132]: Loop Invariant Derived loop invariant: (!(0 == ldv_retval_0) || 1 == ldv_module_refcounter) || !(1 == \old(ldv_module_refcounter)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 128 locations, 1 error locations. SAFE Result, 25.4s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2294 SDtfs, 1219 SDslu, 7641 SDs, 0 SdLazy, 1239 SolverSat, 249 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 947 GetRequests, 804 SyntacticMatches, 18 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 281 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 968 PreInvPairs, 1017 NumberOfFragments, 995 HoareAnnotationTreeSize, 968 FomulaSimplifications, 4788 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 7978 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2189 NumberOfCodeBlocks, 2172 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2569 ConstructedInterpolants, 27 QuantifiedInterpolants, 775938 SizeOfPredicates, 37 NumberOfNonLiveVariables, 2971 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 750/825 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...